Mathematical programming strategies for solving the minimum common string partition problem

DOI10.1016/j.ejor.2014.10.049zbMath1341.90107arXiv1405.5646MaRDI QIDQ2630223

Christian Blum, Pinacho Davidson, José A. Lozano

Publication date: 26 July 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.5646

zbMATH Keywords

integer linear programmingheuristicminimum common string partition

Mathematics Subject Classification ID

90C10: Integer programming

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

Related Items

Unnamed Item, Computational performance evaluation of two integer linear programming models for the minimum common string partition problem, On the role of metaheuristic optimization in bioinformatics, Minimum common string partition: on solving large‐scale problem instances, Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization, Graph algorithms for DNA sequencing -- origins, current models and the future, ILP-based reduced variable neighborhood search for large-scale minimum common string partition, A comparative analysis of two matheuristics by means of merged local optima networks, Solving the minimum common string partition problem with the help of ants

Uses Software

• CPLEX

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
• Optimization Approaches for Solving String Selection Problems
• The string edit distance matching problem with moves
• Quick Greedy Computation for Minimum Common String Partitions
• Algorithms on Strings, Trees and Sequences
• 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
• Efficient algorithms for local alignment search
• Efficient algorithms for similarity search