An algorithm with linear expected running time for string editing with substitutions and substring reversals
From MaRDI portal
Publication:963370
DOI10.1016/j.ipl.2007.11.017zbMath1192.68936MaRDI QIDQ963370
Publication date: 19 April 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2007.11.017
68W32: Algorithms on strings
Cites Work
- An efficient algorithm for sequence comparison with block reversals
- Efficient algorithms for approximate string matching with swaps
- Block edit models for approximate string matching
- Transforming cabbage into turnip
- Approximate nearest neighbors and sequence comparison with block operations
- The theory and computation of evolutionary distances: Pattern recognition
- Algorithms on Strings, Trees and Sequences
- The String-to-String Correction Problem
- String Processing and Information Retrieval