The Boyer–Moore–Galil String Searching Strategies Revisited
From MaRDI portal
Publication:3718165
DOI10.1137/0215007zbMath0589.68047OpenAlexW2006435065MaRDI 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
Related Items (22)
Structural properties of the string statistics problem ⋮ Tight bounds on the complexity of the Apostolico-Giancarlo algorithm ⋮ Speeding up two string-matching algorithms ⋮ On Boyer-Moore automata ⋮ Light-based string matching ⋮ ALGORITHMS FOR JUMBLED PATTERN MATCHING IN STRINGS ⋮ Parallel construction of a suffix tree with applications ⋮ Saving comparisons in the Crochemore-Perrin string-matching algorithm ⋮ A unifying look at the Apostolico--Giancarlo string-matching algorithm ⋮ String matching with weighted errors ⋮ On-line string matching algorithms: survey and experimental results ⋮ A faster quick search algorithm ⋮ How the character comparison order shapes the shift function of on-line pattern matching algorithms ⋮ On the string matching with \(k\) mismatches ⋮ Periodicity and repetitions in parameterized strings ⋮ A variation on the Boyer-Moore algorithm ⋮ Unnamed Item ⋮ On algorithms that effectively distinguish gradient-like dynamics on surfaces ⋮ On the size of Boyer-Moore automata ⋮ A New String Matching Algorithm ⋮ Speeding up two string-matching algorithms ⋮ Periodicity and Repetitions in Parameterized Strings
This page was built for publication: The Boyer–Moore–Galil String Searching Strategies Revisited
