Computational performance evaluation of two integer linear programming models for the minimum common string partition problem
From MaRDI portal
Publication:5963700
DOI10.1007/s11590-015-0921-4zbMath1339.90236arXiv1501.02388OpenAlexW1567328788MaRDI QIDQ5963700
Günther R. Raidl, Christian Blum
Publication date: 23 February 2016
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.02388
Related Items
On the role of metaheuristic optimization in bioinformatics ⋮ Minimum common string partition: on solving large‐scale problem instances ⋮ ILP-based reduced variable neighborhood search for large-scale minimum common string partition
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Minimum common string partition revisited
- Computing a longest common subsequence for a set of strings
- The greedy algorithm for edit distance with moves
- Solving the minimum common string partition problem with the help of ants
- Mathematical programming strategies for solving the minimum common string partition problem
- The string edit distance matching problem with moves
- Quick Greedy Computation for Minimum Common String Partitions
- Exponential and Polynomial Time Algorithms for the Minimum Common String Partition Problem
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set
- Mathematical Foundations of Computer Science 2005
- Algorithms and Computation