The greedy algorithm for edit distance with moves

DOI10.1016/J.IPL.2005.08.010MaRDI QIDQ1045883zbMATH OpenOpenAlexFDO

Authors Haim Kaplan, Nira Shafrir

Publication date 18 December 2009

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2005.08.010

zbMATH Keywords

analysis of algorithmsgreedy algorithmapproximation algorithmsstring matchingedit distance with moves

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Approximation algorithms (68W25)

Cites work

• scientific article; zbMATH DE number 2087046 (Why is no real title available?)
• scientific article; zbMATH DE number 2119725 (Why is no real title available?)
• Algorithms and Computation
• Algorithms on Strings, Trees and Sequences
• Approximate nearest neighbors and sequence comparison with block operations
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Block edit models for approximate string matching

Cited in

(9)

• Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies
• Fast matching-based approximations for maximum duo-preservation string mapping and its weighted variant
• Mathematical programming strategies for solving the minimum common string partition problem
• Computational performance evaluation of two integer linear programming models for the minimum common string partition problem
• Minimum common string partition revisited
• Quick greedy computation for minimum common string partitions
• Quick greedy computation for minimum common string partition
• Efficient algorithms for the block edit problems
• Edit distance with block deletions

This page was built for publication: The greedy algorithm for edit distance with moves

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