On-Line Approximate String Searching Algorithms: Survey and Experimental Results
From MaRDI portal
Publication:4551538
DOI10.1080/00207160212111zbMath1024.68023OpenAlexW1984389605MaRDI QIDQ4551538
Panagiotis D. Michailidis, Konstantinos G. Margaritis
Publication date: 20 November 2003
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160212111
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simple and efficient string matching with k mismatches
- A fast algorithm for string matching with mismatches
- Approximate string matching with suffix automata
- Efficient string matching with k mismatches
- Data structures and algorithms for approximate string matching
- Fast string matching with k differences
- A faster algorithm computing string edit distances
- Approximate string-matching with \(q\)-grams and maximal matches
- Fast two-dimensional pattern matching
- Faster approximate string matching
- Fast string matching with mismatches
- Sublinear approximate string matching and biological applications
- Fast and practical approximate string matching
- Multiple filtration and approximate pattern matching
- A subquadratic algorithm for approximate limited expression matching
- On-line string matching algorithms: survey and experimental results
- A fast string searching algorithm
- A fast bit-vector algorithm for approximate string matching based on dynamic programming
- An Improved Algorithm For Approximate String Matching
- Finding approximate patterns in strings
- Algorithms for approximate string matching
- Algorithms for pattern matching
- The theory and computation of evolutionary distances: Pattern recognition
- A comparison of three string matching algorithms
- 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
- The String-to-String Correction Problem
- New and faster filters for multiple approximate string matching
