A Correct Preprocessing Algorithm for Boyer–Moore String-Searching
From MaRDI portal
Publication:3891776
DOI10.1137/0209037zbMath0446.68049MaRDI QIDQ3891776
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
Related Items
A Heuristic For Computing Repeats With A Factor Oracle: Application To Biological Sequences, Speeding up two string-matching algorithms, Fast algorithms for two dimensional and multiple pattern matching, Tight bounds on the complexity of the Apostolico-Giancarlo algorithm, A complete mechanization of correctness of a string-preprocessing algorithm, A unifying look at the Apostolico--Giancarlo string-matching algorithm, A variation on the Boyer-Moore algorithm, Speeding up two string-matching algorithms, Correctness of substring-preprocessing in Boyer-Moore's pattern matching algorithm, Unnamed Item