Fast String Matching in Stationary Ergodic Sources
From MaRDI portal
Publication:2785374
DOI10.1017/S0963548300002169zbMath0863.68058OpenAlexW2146397605MaRDI QIDQ2785374
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
Related Items
Cites Work
- A Mathematical Theory of Communication
- Modeling splits in file structures
- An approximate string-matching algorithm
- A fast string searching algorithm
- On the Expected Sublinearity of the Boyer–Moore Algorithm
- The Complexity of Pattern Matching for a Random String
- A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm
- A comparison of three string matching algorithms
- Fast Pattern Matching in Strings
- An Elementary Proof of the AEP of Information Theory
This page was built for publication: Fast String Matching in Stationary Ergodic Sources