On the Expected Sublinearity of the Boyer–Moore Algorithm

DOI10.1137/0217041zbMath0651.68072OpenAlexW2003268129MaRDI QIDQ3796763

Robert Schaback

Publication date: 1988

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0217041

zbMATH Keywords

pattern matchingstring searchingaverage case analysis of algorithmsBoyer-Moore string-matching algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Pattern recognition, speech recognition (68T10)

Related Items (3)

A unifying look at the Apostolico--Giancarlo string-matching algorithm ⋮ Average running time of the Boyer-Moore-Horspool algorithm ⋮ Fast String Matching in Stationary Ergodic Sources

This page was built for publication: On the Expected Sublinearity of the Boyer–Moore Algorithm