New and faster filters for multiple approximate string matching
From MaRDI portal
Publication:4534215
DOI10.1002/rsa.10014zbMath0996.68244OpenAlexW2047203512MaRDI QIDQ4534215
Gonzalo Navarro, Ricardo A. Baeza-Yates
Publication date: 5 June 2002
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.10014
Related Items
Approximate string matching using compressed suffix arrays ⋮ On-Line Approximate String Searching Algorithms: Survey and Experimental Results ⋮ Efficient string-matching allowing for non-overlapping inversions ⋮ String matching with inversions and translocations in linear average time (most of the time) ⋮ Text searching allowing for inversions and translocations of factors ⋮ Efficient generation of super condensed neighborhoods ⋮ Faster approximate string matching for short patterns ⋮ Improved approximate pattern matching on hypertext ⋮ FLEXIBLE MUSIC RETRIEVAL IN SUBLINEAR TIME
Cites Work
- Very fast and simple approximate string matching
- Simple and efficient string matching with k mismatches
- Approximate string-matching with \(q\)-grams and maximal matches
- Faster approximate string matching
- Sublinear approximate string matching and biological applications
- A sublinear algorithm for approximate keyword searching
- A subquadratic algorithm for approximate limited expression matching
- A fast string searching algorithm
- An Improved Algorithm For Approximate String Matching
- Finding approximate patterns in strings
- Algorithms for approximate string matching
- The theory and computation of evolutionary distances: Pattern recognition
- Approximate Boyer–Moore String Matching
- Efficient string matching
- Fast Pattern Matching in Strings
- Fast parallel and serial approximate string matching
- Approximate string matching using withinword parallelism
- Improving an algorithm for approximate pattern matching
This page was built for publication: New and faster filters for multiple approximate string matching
