On improving the worst case running time of the Boyer-Moore string matching algorithm
From MaRDI portal
Publication:3048242
DOI10.1145/359146.359148zbMATH Open0413.68041DBLPjournals/cacm/Galil79OpenAlexW1973272384WikidataQ56390278 ScholiaQ56390278MaRDI QIDQ3048242FDOQ3048242
Publication date: 1979
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/359146.359148
Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)
Cited In (19)
- Periodicity and Repetitions in Parameterized Strings
- A New String Matching Algorithm
- Tight bounds on the complexity of the Apostolico-Giancarlo algorithm
- On-line string matching algorithms: survey and experimental results
- Set intersection and sequence matching with mismatch counting
- Complexity of substring search in a set of strings
- Speeding up two string-matching algorithms
- On the size of Boyer-Moore automata
- Constant-space string-matching in sublinear average time
- A faster quick search algorithm
- A unifying look at the Apostolico--Giancarlo string-matching algorithm
- Speeding up two string-matching algorithms
- On Boyer-Moore automata
- Time-space-optimal string matching
- Parallel String Matching Algorithms
- A simple fast hybrid pattern-matching algorithm
- A variation on the Boyer-Moore algorithm
- On the string matching with \(k\) mismatches
- Periodicity and repetitions in parameterized strings
This page was built for publication: On improving the worst case running time of the Boyer-Moore string matching algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3048242)
