Minimum common string partition revisited
From MaRDI portal
Publication:437061
DOI10.1007/s10878-010-9370-2zbMath1244.90195OpenAlexW2056694549MaRDI QIDQ437061
Haitao Jiang, Binhai Zhu, Daming Zhu, Hong Zhu
Publication date: 17 July 2012
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-010-9370-2
Related Items (12)
Mathematical programming strategies for solving the minimum common string partition problem ⋮ Parameterized tractability of the maximum-duo preservation string mapping problem ⋮ Permutation-constrained common string partitions with applications ⋮ The complexity of finding common partitions of genomes with predefined block sizes ⋮ Minimum common string partition: on solving large‐scale problem instances ⋮ Revisiting the parameterized complexity of maximum-duo preservation string mapping ⋮ Quick greedy computation for minimum common string partition ⋮ A \((1.4+\epsilon)\)-approximation algorithm for the 2-\textsc{Max-Duo} problem ⋮ Fixed-parameter tractability for minimum tree cut/paste distance and minimum common integer partition ⋮ Computational performance evaluation of two integer linear programming models for the minimum common string partition problem ⋮ Unnamed Item ⋮ A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximating reversal distance for strings with bounded number of duplicates
- Reversal distance for strings with duplicates: linear time approximation using hitting set
- The greedy algorithm for edit distance with moves
- Parametrized complexity theory.
- Sorting Strings by Reversals and by Transpositions
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Mathematical Foundations of Computer Science 2005
- Algorithms and Computation
This page was built for publication: Minimum common string partition revisited
