A unifying look at the Apostolico--Giancarlo string-matching algorithm
From MaRDI portal
Publication:876692
Recommendations
Cites work
- scientific article; zbMATH DE number 5725179 (Why is no real title available?)
- scientific article; zbMATH DE number 4045218 (Why is no real title available?)
- scientific article; zbMATH DE number 801745 (Why is no real title available?)
- scientific article; zbMATH DE number 828444 (Why is no real title available?)
- A Correct Preprocessing Algorithm for Boyer–Moore String-Searching
- A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm
- A fast string searching algorithm
- Algorithms on Strings, Trees and Sequences
- Fast Pattern Matching in Strings
- On improving the worst case running time of the Boyer-Moore string matching algorithm
- On the Expected Sublinearity of the Boyer–Moore Algorithm
- Speeding up two string-matching algorithms
- The Boyer–Moore–Galil String Searching Strategies Revisited
- Tight bounds on the complexity of the Apostolico-Giancarlo algorithm
Cited in
(3)
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)