An analytical comparison of two string searching algorithms

DOI10.1016/0020-0190(84)90003-6zbMath0551.68055OpenAlexW2073493696MaRDI QIDQ800732

Gerhard Barth

Publication date: 1984

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(84)90003-6

zbMATH Keywords

pattern matchingtext processinganalysis of combinatorial algorithmsaverage case time complexitysubstring searching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (3)

Optimal pattern matching algorithms ⋮ Average running time of the Boyer-Moore-Horspool algorithm ⋮ Designing optimal- and fast-on-average pattern matching algorithms

Cites Work

• String overlaps, pattern matching, and nontransitive games
• Fast Pattern Matching in Strings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An analytical comparison of two string searching algorithms