Practical algorithms for transposition-invariant string-matching
From MaRDI portal
Publication:2569401
DOI10.1016/j.jda.2004.08.009zbMath1101.68961MaRDI QIDQ2569401
Gonzalo Navarro, Kjell Lemström, Yoan J. Pinzon
Publication date: 27 October 2005
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2004.08.009
68W05: Nonnumerical algorithms
Related Items
Cites Work
- A fast and practical bit-vector algorithm for the longest common subsequence problem
- VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING
- A fast bit-vector algorithm for approximate string matching based on dynamic programming
- Algorithms on Strings, Trees and Sequences
- String Processing and Information Retrieval
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item