The greedy algorithm for edit distance with moves
From MaRDI portal
Publication:1045883
DOI10.1016/j.ipl.2005.08.010zbMath1184.68639MaRDI QIDQ1045883
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
greedy algorithm; analysis of algorithms; string matching; approximation algorithms; edit distance with moves
Related Items
Unnamed Item, Computational performance evaluation of two integer linear programming models for the minimum common string partition problem, Minimum common string partition revisited, Efficient algorithms for the block edit problems, Edit distance with block deletions, Quick greedy computation for minimum common string partition, Mathematical programming strategies for solving the minimum common string partition problem, Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies, Quick Greedy Computation for Minimum Common String Partitions
Cites Work
- Block edit models for approximate string matching
- Approximate nearest neighbors and sequence comparison with block operations
- Algorithms on Strings, Trees and Sequences
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Algorithms and Computation
- Unnamed Item
- Unnamed Item