A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem

DOI10.1007/978-3-540-73556-4_29MaRDI QIDQ3611980zbMATH OpenOpenAlexFDO

Authors Ernst Althaus, Stefan Canzar

Publication date 3 March 2009

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL http://link.springer.com/10.1007/s10878-008-9139-z

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90) Dynamic programming (90C39) Systems biology, networks (92C42) Integer programming (90C10)

Recommendations

• A Lagrangian relaxation approach for the multiple sequence alignment problem
• An optimization approach to multiple sequence alignment
• Computational and Information Science
• Algorithms and Computation
• A fast algorithm for the constrained multiple sequence alignment problem
• New formulations of the multiple sequence alignment problem
• Approximation algorithms for multiple sequence alignment
• Lagrangian relaxations for multiple network alignment
• A New Dynamic Programming Algorithm for Multiple Sequence Alignment

Cited in

(5)

• Lagrangian relaxations for multiple network alignment
• Integer Linear Programming in Computational Biology
• A Lagrangian relaxation approach for the multiple sequence alignment problem
• A Lagrangian-ACO matheuristic for car sequencing
• Lagrangian approaches for a class of matching problems in computational biology

This page was built for publication: A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3611980)