Fast and practical approximate string matching
From MaRDI portal
Publication:1847363
DOI10.1016/0020-0190(96)00083-XzbMath1046.68514MaRDI QIDQ1847363
Chris H. Perleberg, Ricardo A. Baeza-Yates
Publication date: 24 June 2003
Published in: Information Processing Letters (Search for Journal in Brave)
68P10: Searching and sorting
68W05: Nonnumerical algorithms
68T10: Pattern recognition, speech recognition
Related Items
On-Line Approximate String Searching Algorithms: Survey and Experimental Results, Very fast and simple approximate string matching, A new filtration method and a hybrid strategy for approximate string matching, Novel evolutionary models and applications to sequence alignment problems, Application of max-plus algebra to biological sequence comparisons, Multiple filtration and approximate pattern matching, Approximate Boyer-Moore string matching for small alphabets, Approximate pattern matching on elastic-degenerate text, A lower-variance randomized algorithm for approximate string matching, Approximate search of short patterns with high error rates using the \(01^\ast 0\) lossless seeds, Lossless Seeds for Searching Short Patterns with High Error Rates, Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment, An artificial neural network based approach for online string matching/filtering of large databases
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simple and efficient string matching with k mismatches
- Approximate string matching with suffix automata
- Efficient string matching with k mismatches
- An \(O(ND)\) difference algorithm and its variations
- Fast string matching with k differences
- On saving space in parallel computation
- Fast two-dimensional pattern matching
- Faster approximate string matching
- Fast string matching with mismatches
- A subquadratic algorithm for approximate limited expression matching
- An Improved Algorithm For Approximate String Matching
- Finding approximate patterns in strings
- Generalized String Matching
- Augmenting the aho-corasick pattern matching machine
- Efficient string matching
- Fast Pattern Matching in Strings
- Boyer-Moore approach to approximate string matching