String searching algorithms revisited

DOI10.1007/3-540-51542-9_9MaRDI QIDQ4028877zbMATH OpenFDO

Authors Ricardo Baeza-Yates

Publication date 28 March 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-51542-9_9

zbMATH Keywords

Boyer-Moore-Horspool algorithmKnuth-Morris-Pratt algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Recommendations

• A simple fast hybrid pattern-matching algorithm
• Combinatorial Pattern Matching
• scientific article; zbMATH DE number 3943041
• An analytical comparison of two string searching algorithms
• A fast string searching algorithm

Cited in

(17)

• Average running time of the Boyer-Moore-Horspool algorithm
• On Boyer-Moore automata
• Testing a one-closure equation turbulence model in neutral boundary layers
• The complexity of searching a sorted array of strings
• Tuning the Zhu-Takaoka string matching algorithm and experimental results.
• Fast Searching in Packed Strings
• scientific article; zbMATH DE number 3976359 (Why is no real title available?)
• scientific article; zbMATH DE number 4045218 (Why is no real title available?)
• scientific article; zbMATH DE number 17821 (Why is no real title available?)
• scientific article; zbMATH DE number 1982178 (Why is no real title available?)
• scientific article; zbMATH DE number 2092676 (Why is no real title available?)
• Fast algorithms for two dimensional and multiple pattern matching
• Boyer-Moore approach to approximate string matching
• Irredundant intervals
• Combinatorial Pattern Matching
• Efficient parameterized string matching
• Some string matching problems from bioinformatics which still need better solutions

This page was built for publication: String searching algorithms revisited

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