A variation on the Boyer-Moore algorithm
DOI10.1016/0304-3975(92)90139-7zbMATH Open0747.68023OpenAlexW2100810239MaRDI QIDQ1190458FDOQ1190458
Authors: Thierry Lecroq 
Publication date: 26 September 1992
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(92)90139-7
Recommendations
linear- time algorithmBoyer-Moore automatonlongest prefix of the wordquadratic worst-case running timesmallest suffix automaton
Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)
Cites Work
- 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
- The smallest automaton recognizing the subwords of a text
- Transducers and repetitions
- Title not available (Why is that?)
- On Boyer-Moore automata
- 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
Cited In (9)
- On-line string matching algorithms: survey and experimental results
- Speeding up two string-matching algorithms
- The wide window string matching algorithm
- Speeding up two string-matching algorithms
- Title not available (Why is that?)
- Finite automata for generalized approach to backward pattern matching
- Title not available (Why is that?)
- On the string matching with \(k\) mismatches
- A Variant of the F4 Algorithm
This page was built for publication: A variation on the Boyer-Moore algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1190458)
