Algorithms that find one string or pattern inside another, such as Aho-Corasick, Boyer-Moore-Horspool, the bitap algorithm and the Z algorithm. An algorithm belongs here when its cited article describes searching for substrings or matching patterns in text. It excludes algorithms that measure how far apart two strings are, which sit in the edit distance group. A member is placed here by what its own cited article states about it, not by the name of the algorithm or by the uses it is put to today, so each entry sits in the group its source describes it as belonging to.
Browse By
String Searching Algorithms
Filter Results10 entries
Sources
Manacher's Algorithm (Wikipedia)
Has Member: Manacher's Algorithm, LeadQuote, Has Member: Manacher's Algorithm, Lead
the longest palindromic substring or longest symmetric factor problem is the problem of finding a maximum-length contiguous substring of a given string that is also a palindrome
Commentz-Walter algorithm (Wikipedia)
Has Member: Commentz-Walter algorithm, Lead paragraphQuote, Has Member: Commentz-Walter algorithm, Lead paragraph
the Commentz-Walter algorithm is a string searching algorithm invented by Beate Commentz-Walter
Raita algorithm (Wikipedia)
Has Member: Raita algorithm, Lead paragraphQuote, Has Member: Raita algorithm, Lead paragraph
the Raita algorithm is a string searching algorithm which improves the performance of Boyer
Aho-Corasick algorithm, Wikipedia
Has Member: Aho-Corasick Algorithm, Lead sectionQuote, Has Member: Aho-Corasick Algorithm, Lead section
is a string-searching algorithm
Boyer-Moore-Horspool algorithm (Wikipedia)
Has Member: Boyer-Moore-Horspool Algorithm, Lead sectionQuote, Has Member: Boyer-Moore-Horspool Algorithm, Lead section
algorithm for finding substrings in strings
Bitap Algorithm (Wikipedia)
Has Member: Bitap Algorithm, Lead sectionQuote, Has Member: Bitap Algorithm, Lead section
approximate string matching algorithm
Wikipedia: Boyer-Moore Algorithm
Wikimedia FoundationHas Member: Boyer-Moore Algorithm, Lead sectionQuote, Has Member: Boyer-Moore Algorithm, Lead section
is an efficient string-searching algorithm
Ukkonen's Algorithm (Wikipedia)
Has Member: Ukkonen's Algorithm, LeadQuote, Has Member: Ukkonen's Algorithm, Lead
In computer science, Ukkonen's algorithm is a linear-time, online algorithm for constructing suffix trees, proposed by Esko Ukkonen in 1995.
Wikipedia: Suffix Array
Wikimedia FoundationHas Member: Suffix Array Construction Algorithm, LeadQuote, Has Member: Suffix Array Construction Algorithm, Lead
In computer science, a suffix array is a sorted array of all suffixes of a string.
NIST Dictionary of Algorithms and Data Structures: longest common substring
NIST Dictionary of Algorithms and Data StructuresHas Member: Longest Common Substring Algorithm, DefinitionQuote, Has Member: Longest Common Substring Algorithm, Definition
Find the longest substring of two or more strings .
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.