Efficient algorithms for approximate string matching with swaps
From MaRDI portal
Publication:1288533
DOI10.1006/jcom.1998.0497zbMath0921.68042MaRDI QIDQ1288533
Jee-Soo Lee, Dong Kyue Kim, Yookun Cho, Kun Soo Park
Publication date: 11 May 1999
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/9a1be690d4f432594b60ca356cf4e75f0e324fd6
68W10: Parallel algorithms in computer science
Related Items
DICTIONARY LOOK-UP WITHIN SMALL EDIT DISTANCE, An algorithm with linear expected running time for string editing with substitutions and substring reversals
Cites Work
- Unnamed Item
- Unnamed Item
- Approximate string matching with suffix automata
- An \(O(ND)\) difference algorithm and its variations
- Data structures and algorithms for approximate string matching
- An Improved Algorithm For Approximate String Matching
- Algorithms for approximate string matching
- An Extension of the String-to-String Correction Problem
- Fast parallel and serial approximate string matching
- Sparse dynamic programming I
- The String-to-String Correction Problem