Fast string matching in stationary ergodic sources

DOI10.1017/S0963548300002169MaRDI QIDQ2785374zbMATH OpenOpenAlexFDO

Authors John Shawe-Taylor

Publication date 22 May 1997

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0963548300002169

zbMATH Keywords

search algorithmstring searching

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• String matching: The ergodic case
• Fast and practical approximate string matching
• Fast string matching by using probabilities: on an optimal mismatch variant of Horspool's algorithm
• Fast pattern-matching on indeterminate strings
• scientific article; zbMATH DE number 975393
• Fast parallel and serial approximate string matching
• Constant-Time Randomized Parallel String Matching
• scientific article; zbMATH DE number 3845091
• A randomized algorithm for approximate string matching

Cites work

• A comparison of three string matching algorithms
• A fast string searching algorithm
• A Mathematical Theory of Communication
• A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm
• An approximate string-matching algorithm
• An Elementary Proof of the AEP of Information Theory
• Fast Pattern Matching in Strings
• Modeling splits in file structures
• On the Expected Sublinearity of the Boyer–Moore Algorithm
• The Complexity of Pattern Matching for a Random String

Cited in

(4)

• Waiting time and complexity for matching patterns with automata
• An approximate string-matching algorithm
• On the Expected Sublinearity of the Boyer–Moore Algorithm
• String Matching: Communication, Circuits, and Learning.

This page was built for publication: Fast string matching in stationary ergodic sources

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