The greedy algorithm for edit distance with moves

DOI10.1016/J.IPL.2005.08.010zbMATH Open1184.68639OpenAlexW2030016852MaRDI QIDQ1045883FDOQ1045883

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

• Algorithms on Strings, Trees and Sequences
• Title not available (Why is that?)
• Algorithms and Computation
• Title not available (Why is that?)
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Block edit models for approximate string matching
• Approximate nearest neighbors and sequence comparison with block operations

Cited In (9)

• Edit distance with block deletions
• 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 partition
• Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies
• Fast matching-based approximations for maximum duo-preservation string mapping and its weighted variant
• Efficient algorithms for the block edit problems
• Quick greedy computation for minimum common string partitions

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)