A Lagrangian relaxation approach for the multiple sequence alignment problem

DOI10.1007/s10878-008-9139-zzbMath1161.92027OpenAlexW2797388202MaRDI QIDQ1016042

Ernst Althaus, Stefan Canzar

Publication date: 4 May 2009

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-008-9139-z

zbMATH Keywords

Lagrangian relaxationbranch and boundsequence comparison

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05) Dynamic programming (90C39) Biochemistry, molecular biology (92C40)

Related Items (2)

Lagrangian relaxations for multiple network alignment ⋮ Integer Linear Programming in Computational Biology

Uses Software

• LEDA
• MAFFT
• DIALIGN
• ClustalW
• MUSCLE
• T-coffee
• MUMMER

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A branch-and-cut algorithm for multiple sequence alignment
• Sequence comparison with mixed convex and concave costs
• The Multiple Sequence Alignment Problem in Biology
• Algorithms on Strings, Trees and Sequences
• Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
• A Heuristic Method for the Set Covering Problem
• Algorithms and Computation
• The traveling-salesman problem and minimum spanning trees: Part II

This page was built for publication: A Lagrangian relaxation approach for the multiple sequence alignment problem