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

DOI10.1016/J.IPL.2007.11.017zbMATH Open1192.68936OpenAlexW1989944203MaRDI QIDQ963370FDOQ963370

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

• Algorithms on Strings, Trees and Sequences
• The String-to-String Correction Problem
• The theory and computation of evolutionary distances: Pattern recognition
• Transforming cabbage into turnip
• Block edit models for approximate string matching
• Approximate nearest neighbors and sequence comparison with block operations
• An efficient algorithm for sequence comparison with block reversals
• Efficient algorithms for approximate string matching with swaps
• String Processing and Information Retrieval

Cited In (2)

• A Probabilistic Analysis of a String Editing Problem and its Variations
• Title not available (Why is that?)

This page was built for publication: An algorithm with linear expected running time for string editing with substitutions and substring reversals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q963370)