A Lagrangian relaxation approach for the multiple sequence alignment problem
Authors:
- 5 March 2008
- journal article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 16 (2) , 127-154
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- A branch-and-cut algorithm for multiple sequence alignmentMathematical Programming, 2005
- MAFFT version 5: improvement in accuracy of multiple sequence alignmentNucleic Acids Research, 2005
- MUSCLE: multiple sequence alignment with high accuracy and high throughputNucleic Acids Research, 2004
- The Practical Use of the A * Algorithm for Exact Multiple Sequence AlignmentJournal of Computational Biology, 2000
- T-coffee: a novel method for fast and accurate multiple sequence alignment 1 1Edited by J. ThorntonJournal of Molecular Biology, 2000
- Improving the Practical Space and Time Efficiency of the Shortest-Paths Approach to Sum-of-Pairs Multiple Sequence AlignmentJournal of Computational Biology, 1995
- CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choiceNucleic Acids Research, 1994
- Sequence comparison with mixed convex and concave costsJournal of Algorithms, 1990
- The Multiple Sequence Alignment Problem in BiologySIAM Journal on Applied Mathematics, 1988
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971