A branch-and-cut algorithm for multiple sequence alignment
From MaRDI portal
Publication:2583133
DOI10.1007/s10107-005-0659-3zbMath1085.90060MaRDI QIDQ2583133
Alberto Caprara, Ernst Althaus, Knut Reinert, Hans-Peter Lenhof
Publication date: 13 January 2006
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-005-0659-3
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
Related Items
A Lagrangian relaxation approach for the multiple sequence alignment problem, Integer Linear Programming in Computational Biology
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using separation algorithms to generate mixed integer model reformulations
- Potential function methods for approximately solving linear programming problems: theory and practice.
- Compact vs. exponential-size LP relaxations
- Compact optimization can outperform separation: a case study in structural proteomics
- Sequence comparison with mixed convex and concave costs
- The Multiple Sequence Alignment Problem in Biology
- Algorithms on Strings, Trees and Sequences
- A Polyhedral Approach to the Asymmetric Traveling Salesman Problem