String-searching algorithm: Difference between revisions

Revision as of 20:56, 17 April 2016

Revision as of 16:09, 18 June 2016

Line 1:

In [[computer science]], '''string searching algorithms''', sometimes called '''string matching algorithms''', are an important class of [[String_(computer_science)#String_processing_algorithms|string algorithmalgorithms]]s that try to find a place where one or several [[string (computer science)|strings]] (also called [[pattern]]s) are found within a larger string or text.

Let Σ be an [[Alphabet (computer science)|alphabet]] ([[finite set]]). Formally, both the pattern and searched text are vectors of elements of Σ. The Σ may be a usual human alphabet (for example, the letters A through Z in the Latin alphabet). Other applications may use ''binary alphabet'' (Σ = {0,1}) or ''DNA alphabet'' (Σ = {A,C,G,T}) in [[bioinformatics]].