Computational performance evaluation of two integer linear programming models for the minimum common string partition problem
From MaRDI portal
Publication:5963700
Abstract: In the minimum common string partition (MCSP) problem two related input strings are given. "Related" refers to the property that both strings consist of the same set of letters appearing the same number of times in each of the two strings. The MCSP seeks a minimum cardinality partitioning of one string into non-overlapping substrings that is also a valid partitioning for the second string. This problem has applications in bioinformatics e.g. in analyzing related DNA or protein sequences. For strings with lengths less than about 1000 letters, a previously published integer linear programming (ILP) formulation yields, when solved with a state-of-the-art solver such as CPLEX, satisfactory results. In this work, we propose a new, alternative ILP model that is compared to the former one. While a polyhedral study shows the linear programming relaxations of the two models to be equally strong, a comprehensive experimental comparison using real-world as well as artificially created benchmark instances indicates substantial computational advantages of the new formulation.
Recommendations
- Mathematical programming strategies for solving the minimum common string partition problem
- Minimum common string partition: on solving large‐scale problem instances
- Minimum common string partition problem: hardness and approximations
- Algorithms and Computation
- ILP-based reduced variable neighborhood search for large-scale minimum common string partition
- Exponential and polynomial time algorithms for the minimum common string partition problem
- Computational comparison on the partitioning strategies in multiple choice integer programming
- An improved approximation algorithm for the minimum common integer partition problem
- An improved approximation algorithm for the minimum common integer partition problem
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2087046 (Why is no real title available?)
- Algorithms and Computation
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Computing a longest common subsequence for a set of strings
- Exponential and polynomial time algorithms for the minimum common string partition problem
- Mathematical Foundations of Computer Science 2005
- Mathematical programming strategies for solving the minimum common string partition problem
- Minimum common string partition revisited
- Quick greedy computation for minimum common string partitions
- Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set
- Solving the minimum common string partition problem with the help of ants
- The greedy algorithm for edit distance with moves
- The string edit distance matching problem with moves
Cited in
(5)- Mathematical programming strategies for solving the minimum common string partition problem
- Minimum common string partition: on solving large‐scale problem instances
- On the role of metaheuristic optimization in bioinformatics
- Solving the minimum common string partition problem with the help of ants
- ILP-based reduced variable neighborhood search for large-scale minimum common string partition
This page was built for publication: Computational performance evaluation of two integer linear programming models for the minimum common string partition problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963700)
