Mathematical Foundations of Computer Science 2005
From MaRDI portal
Publication:5492891
DOI10.1007/11549345zbMath1156.68617MaRDI QIDQ5492891
Publication date: 20 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11549345
Approximation algorithms; String comparison; Sorting by reversals; Edit distance; Minimum common string partition
68W25: Approximation algorithms
Related Items
Computational performance evaluation of two integer linear programming models for the minimum common string partition problem, Minimum common string partition: on solving large‐scale problem instances, Minimum common string partition revisited, Approximating reversal distance for strings with bounded number of duplicates, Quick greedy computation for minimum common string partition, Mathematical programming strategies for solving the minimum common string partition problem, Quick Greedy Computation for Minimum Common String Partitions