The Boyer–Moore–Galil String Searching Strategies Revisited

DOI10.1137/0215007zbMath0589.68047MaRDI QIDQ3718165

Alberto Apostolico, Raffaele Giancarlo

Publication date: 1986

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

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

zbMATH Keywords

algorithms; pattern matching; text editing; shift functions; analysis of

Mathematics Subject Classification ID

68P10: Searching and sorting

Related Items

A New String Matching Algorithm, Speeding up two string-matching algorithms, Tight bounds on the complexity of the Apostolico-Giancarlo algorithm, How the character comparison order shapes the shift function of on-line pattern matching algorithms, On the size of Boyer-Moore automata, Light-based string matching, A unifying look at the Apostolico--Giancarlo string-matching algorithm, String matching with weighted errors, Periodicity and repetitions in parameterized strings, Structural properties of the string statistics problem, Parallel construction of a suffix tree with applications, A variation on the Boyer-Moore algorithm, Speeding up two string-matching algorithms, On Boyer-Moore automata, Saving comparisons in the Crochemore-Perrin string-matching algorithm, A faster quick search algorithm, On the string matching with \(k\) mismatches, On algorithms that effectively distinguish gradient-like dynamics on surfaces, On-line string matching algorithms: survey and experimental results, ALGORITHMS FOR JUMBLED PATTERN MATCHING IN STRINGS, Unnamed Item, Periodicity and Repetitions in Parameterized Strings