Tight bounds on the complexity of the Apostolico-Giancarlo algorithm

DOI10.1016/S0020-0190(97)00107-5zbMath1336.68313MaRDI QIDQ287179

Thierry Lecroq, Maxime Crochemore

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

computational complexityanalysis of algorithmsstring matching

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Algorithms on strings (68W32)

Related Items (3)

A unifying look at the Apostolico--Giancarlo string-matching algorithm ⋮ Unnamed Item ⋮ A New String Matching Algorithm

Cites Work

• 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
• A Correct Preprocessing Algorithm for Boyer–Moore String-Searching
• Fast Pattern Matching in Strings
• Unnamed Item
• Unnamed Item

This page was built for publication: Tight bounds on the complexity of the Apostolico-Giancarlo algorithm