Product
Help
Pricing
About
Jobs
Log in
Get started
Concept
Add to collection
Boyer–Moore string search algorithm
OpenAlex ID:
C80701825
A fast string searching algorithm
1977
·
Robert S. Boyer
, J. Strother Moore
·
Communications of the ACM
·
2,565
String-matching and Other Products
1974
·
Manuela Fischer
, Mike Paterson
·
DSpace@MIT (Massachusetts Institute of Technology)
·
471
PDF
A very fast substring search algorithm
1990
·
Daniel M. Sunday
·
Communications of the ACM
·
424
PDF
An Improved Algorithm For Approximate String Matching
1990
·
Zvi Galil
, Kunsoo Park
·
SIAM Journal on Computing
·
189
Fast and flexible string matching by combining bit-parallelism and suffix automata
2000
·
Gonzalo Navarro
, Mathieu Raffinot
·
ACM Journal of Experimental Algorithmics
·
179
PDF
Squares, cubes, and time-space efficient string searching
1995
·
M. Crochemore
, W. Rytter
·
Algorithmica
·
155
A bit-parallel approach to suffix automata: Fast extended string matching
1998
·
Gonzalo Navarro
, Mathieu Raffinot
·
Lecture notes in computer science
·
134
Fast exact string matching algorithms
2007
·
Thierry Lecroq
·
Information Processing Letters
·
133
On improving the worst case running time of the Boyer-Moore string matching algorithm
1979
·
Zvi Galil
·
Communications of the ACM
·
131
PDF
A Comparison of Approximate String Matching Algorithms
1996
·
PETTERI JOKINEN
, JORMA TARHIO
, et al.
·
Software Practice and Experience
·
118
Fast and practical approximate string matching
1992
·
Ricardo A. Baeza-Yates
, Chris H. Perleberg
·
Lecture notes in computer science
·
109
Fast and practical approximate string matching
1996
·
Ricardo A. Baeza-Yates
, Chris H. Perleberg
·
Information Processing Letters
·
104
Approximate Boyer–Moore String Matching
1993
·
Jorma Tarhio
, Esko Ukkonen
·
SIAM Journal on Computing
·
100
Tuning the boyer‐moore‐horspool string searching algorithm
1992
·
Timo Raita
·
Software Practice and Experience
·
98
A Fast String Matching Algorithm and Experimental Results.
1999
·
T. G. Berry
, Somasundaram Ravindran
·
Prague Stringology Conference
·
80
Improved string searching
1989
·
Ricardo A. Baeza‐Yates
·
Software Practice and Experience
·
76
Experimental results on string matching algorithms
1995
·
Thierry Lecroq
·
Software Practice and Experience
·
73
Approximate string matching with suffix automata
1993
·
Esko Ukkonen
, Derick Wood
·
Algorithmica
·
70
A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm
1980
·
Leo J. Guibas
, Andrew M. Odlyzko
·
SIAM Journal on Computing
·
62
A Correct Preprocessing Algorithm for Boyer–Moore String-Searching
1980
·
Wojciech Rytter
·
SIAM Journal on Computing
·
62
A Boyer—Moore Type Algorithm for Compressed Pattern Matching
2000
·
Yusuke Shibata
, Tetsuya Matsumoto
, et al.
·
Lecture notes in computer science
·
60
Forest-to-String Statistical Translation Rules
2007
·
Yang Liu
, Yun Huang
, et al.
·
59
On-line string matching algorithms: survey and experimental results
2001
·
P.D. Michailidis
, K.G. Margaritis
·
International Journal of Computer Mathematics
·
59
A comparison of three string matching algorithms
1982
·
G. De V. Smit
·
Software Practice and Experience
·
59
On improving the average case of the Boyer-Moore string matching algorithm
1988
·
Zhu Rui Feng
, T. Takaoka
·
Journal of information processing
·
56
Show more works
View as search
Works count:
616
Citation count:
8,382
Year
Topic
Type