The Boyer-Moore-Horspool heuristic with Markovian input

DOI<153::AID-RSA1003>3.0.CO;2-O 10.1002/1098-2418(200103)18:2<153::AID-RSA1003>3.0.CO;2-OzbMath0973.60021OpenAlexW2017227388MaRDI QIDQ2712578

Robert T. Smythe

Publication date: 6 May 2001

Full work available at URL: https://doi.org/10.1002/1098-2418(200103)18:2<153::aid-rsa1003>3.0.co;2-o

zbMATH Keywords

strong lawMarkov renewal processcentral limit theoremBoyer-Moore-Horspool algorithmMarkov chain inputs

Mathematics Subject Classification ID

Combinatorial probability (60C05)

Related Items (3)

Optimal pattern matching algorithms ⋮ An algorithm to compute the character access count distribution for pattern matching algorithms ⋮ Designing optimal- and fast-on-average pattern matching algorithms

Cites Work

• Average running time of the Boyer-Moore-Horspool algorithm
• Analysis of Boyer-Moore-Horspool string-matching heuristic
• Sur deux problèmes de M. Kolmogoroff concernant les chaînes dénombrables
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Boyer-Moore-Horspool heuristic with Markovian input