A branch-and-cut algorithm for multiple sequence alignment
- 10 November 2005
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 105 (2-3) , 387-425
- https://doi.org/10.1007/s10107-005-0659-3
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- An improved algorithm for matching biological sequencesPublished by Elsevier ,2004
- Compact optimization can outperform separation: A case study in structural proteomics4OR, 2004
- Compact vs. exponential-size LP relaxationsOperations Research Letters, 2002
- Alignment of whole genomesNucleic Acids Research, 1999
- A Polyhedral Approach to the Asymmetric Traveling Salesman ProblemManagement Science, 1997
- Improving the Practical Space and Time Efficiency of the Shortest-Paths Approach to Sum-of-Pairs Multiple Sequence AlignmentJournal of Computational Biology, 1995
- Basic local alignment search toolJournal of Molecular Biology, 1990
- Sequence comparison with mixed convex and concave costsJournal of Algorithms, 1990
- The Multiple Sequence Alignment Problem in BiologySIAM Journal on Applied Mathematics, 1988
- Perfect GraphsPublished by Elsevier ,1980