Speeding up two string-matching algorithms

DOI10.1007/3-540-55210-3_215zbMath1494.68316OpenAlexW2150774287MaRDI QIDQ5096813

Wojciech Plandowski, Thierry Lecroq, Maxime Crochemore, Stefan Jarominek, Wojciech Rytter, Artur Czumaj, Leszek Gąsieniec

Publication date: 18 August 2022

Published in: STACS 92 (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.141.2476

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The smallest automaton recognizing the subwords of a text
• Average running time of the Boyer-Moore-Horspool algorithm
• A variation on the Boyer-Moore algorithm
• Transducers and repetitions
• On improving the worst case running time of the Boyer-Moore string matching algorithm
• A fast string searching algorithm
• The Boyer–Moore–Galil String Searching Strategies Revisited
• The Complexity of Pattern Matching for a Random String
• A Correct Preprocessing Algorithm for Boyer–Moore String-Searching
• A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm
• Fast Pattern Matching in Strings