Faster algorithms for string matching with k mismatches
- 13 September 2003
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 50 (2) , 257-275
- https://doi.org/10.1016/s0196-6774(03)00097-x
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Pattern Matching with SwapsJournal of Algorithms, 2000
- Efficient special cases of Pattern Matching with SwapsInformation Processing Letters, 1998
- A Time to SequenceScience, 1995
- Fast algorithms for approximately counting mismatchesInformation Processing Letters, 1993
- Fast parallel and serial approximate string matchingJournal of Algorithms, 1989
- Efficient string matching with k mismatchesTheoretical Computer Science, 1986
- Improved string matching with k mismatchesACM SIGACT News, 1986
- Algorithms for approximate string matchingInformation and Control, 1985
- A fast string searching algorithmCommunications of the ACM, 1977
- A Space-Economical Suffix Tree Construction AlgorithmJournal of the ACM, 1976