A Correct Preprocessing Algorithm for Boyer–Moore String-Searching

DOI10.1137/0209037MaRDI QIDQ3891776zbMATH OpenOpenAlexFDO

Authors Wojciech Rytter

Publication date 1980

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

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

zbMATH Keywords

algorithmBoyer-Moore string-searchingpattern matchingtable of pattern shifts

Mathematics Subject Classification ID

Searching and sorting (68P10) Information storage and retrieval of data (68P20)

Cited in

(10)

• A variation on the Boyer-Moore algorithm
• Speeding up two string-matching algorithms
• Correctness of substring-preprocessing in Boyer-Moore's pattern matching algorithm
• Tight bounds on the complexity of the Apostolico-Giancarlo algorithm
• Tuning the Zhu-Takaoka string matching algorithm and experimental results.
• A Heuristic For Computing Repeats With A Factor Oracle: Application To Biological Sequences
• Fast algorithms for two dimensional and multiple pattern matching
• Speeding up two string-matching algorithms
• A complete mechanization of correctness of a string-preprocessing algorithm
• A unifying look at the Apostolico--Giancarlo string-matching algorithm

This page was built for publication: A Correct Preprocessing Algorithm for Boyer–Moore String-Searching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3891776)