Fast string matching by using probabilities: on an optimal mismatch variant of Horspool's algorithm
From MaRDI portal
Publication:2503305
DOI10.1016/j.tcs.2006.05.028zbMath1097.68141MaRDI QIDQ2503305
Publication date: 14 September 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.05.028
Related Items
Improved and self-tuned occurrence heuristics, An artificial neural network based approach for online string matching/filtering of large databases
Cites Work
- Asymptotic expected number of base pairs in optimal secondary structure for random RNA using the Nussinov--Jacobson energy model
- A fast string searching algorithm
- Fast Pattern Matching in Strings
- The elements of statistical learning. Data mining, inference, and prediction
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item