Average case analysis of the Boyer‐Moore algorithm

DOI10.1002/RSA.20111MaRDI QIDQ5486324zbMATH OpenOpenAlexFDO

Authors Tsung-Hsi Tsai

Publication date 6 September 2006

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/rsa.20111

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• Average running time of the Boyer-Moore-Horspool algorithm
• Fastest Pattern Matching in Strings
• On the Expected Sublinearity of the Boyer–Moore Algorithm
• The Boyer-Moore-Horspool heuristic with Markovian input
• scientific article; zbMATH DE number 17821

Cited in

(9)

• Optimal pattern matching algorithms
• The Boyer-Moore-Horspool heuristic with Markovian input
• Average running time of the Boyer-Moore-Horspool algorithm
• Average-case analysis of the double description method and the beneath-beyond algorithm
• IDPM: an improved degenerate pattern matching algorithm for biological sequences
• An algorithm to compute the character access count distribution for pattern matching algorithms
• Designing optimal- and fast-on-average pattern matching algorithms
• Improved pattern-scan-order algorithms for string matching
• The wide window string matching algorithm

This page was built for publication: Average case analysis of the Boyer‐Moore algorithm

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