A unifying look at the Apostolico--Giancarlo string-matching algorithm

DOI10.1016/S1570-8667(03)00005-4zbMath1118.68447MaRDI QIDQ876692

Christophe Hancart, Maxime Crochemore, Thierry Lecroq

Publication date: 26 April 2007

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

zbMATH Keywords

string matchinganalysis of algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Nonnumerical algorithms (68W05) Pattern recognition, speech recognition (68T10)

Related Items

PAMA: A FAST STRING MATCHING ALGORITHM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tight bounds on the complexity of the Apostolico-Giancarlo algorithm
• Speeding up two string-matching algorithms
• On improving the worst case running time of the Boyer-Moore string matching algorithm
• A fast string searching algorithm
• The Boyer–Moore–Galil String Searching Strategies Revisited
• On the Expected Sublinearity of the Boyer–Moore Algorithm
• A Correct Preprocessing Algorithm for Boyer–Moore String-Searching
• A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm
• Fast Pattern Matching in Strings
• Algorithms on Strings, Trees and Sequences