An algorithm with linear expected running time for string editing with substitutions and substring reversals

DOI10.1016/j.ipl.2007.11.017zbMath1192.68936OpenAlexW1989944203MaRDI QIDQ963370

Abdullah N. Arslan

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

zbMATH Keywords

algorithmsdynamic programmingedit distanceexpected running timesubstring reversal

Mathematics Subject Classification ID

Algorithms on strings (68W32)

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