Average case analysis of the Boyer‐Moore algorithm

DOI10.1002/RSA.20111zbMATH Open1110.68165OpenAlexW4252328073MaRDI QIDQ5486324FDOQ5486324

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

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

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (9)

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

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)