Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345zbMath1156.68617OpenAlexW2494705596MaRDI QIDQ5492891

Petr Kolman

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

zbMATH Keywords

Approximation algorithmsString comparisonSorting by reversalsEdit distanceMinimum common string partition

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Related Items (7)

Mathematical programming strategies for solving the minimum common string partition problem ⋮ Approximating reversal distance for strings with bounded number of duplicates ⋮ Minimum common string partition: on solving large‐scale problem instances ⋮ Minimum common string partition revisited ⋮ Quick Greedy Computation for Minimum Common String Partitions ⋮ Quick greedy computation for minimum common string partition ⋮ Computational performance evaluation of two integer linear programming models for the minimum common string partition problem

This page was built for publication: Mathematical Foundations of Computer Science 2005