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

DOI10.1016/S1570-8667(03)00005-4zbMATH Open1118.68447MaRDI QIDQ876692FDOQ876692

Authors: Maxime Crochemore, Christophe Hancart, Thierry Lecroq 

Publication date: 26 April 2007

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

Recommendations

• Tight bounds on the complexity of the Apostolico-Giancarlo algorithm
• A New String Matching Algorithm
• Fastest Pattern Matching in Strings
• scientific article; zbMATH DE number 1615293
• Publication:3468609

zbMATH Keywords

string matchinganalysis of algorithm

Mathematics Subject Classification ID

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

Cites Work

• Algorithms on Strings, Trees and Sequences
• Speeding up two string-matching algorithms
• Tight bounds on the complexity of the Apostolico-Giancarlo algorithm
• 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
• A Correct Preprocessing Algorithm for Boyer–Moore String-Searching
• Fast Pattern Matching in Strings
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm
• On the Expected Sublinearity of the Boyer–Moore Algorithm

Cited In (3)

• Tight bounds on the complexity of the Apostolico-Giancarlo algorithm
• PAMA: A FAST STRING MATCHING ALGORITHM
• A variation on the Boyer-Moore algorithm

This page was built for publication: A unifying look at the Apostolico--Giancarlo string-matching algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876692)