Lagrangian approaches for a class of matching problems in computational biology

DOI10.1016/j.camwa.2006.12.103zbMath1137.92013arXivq-bio/0609001OpenAlexW2063310820WikidataQ113878670 ScholiaQ113878670MaRDI QIDQ929184

Stefan Balev, Philippe Veber, Rumen Andonov, Nicolas Yanev

Publication date: 12 June 2008

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/q-bio/0609001

zbMATH Keywords

Lagrangian relaxationnetwork optimizationgraph matchingcost splittingprotein threading

Mathematics Subject Classification ID

Applications of graph theory (05C90) Integer programming (90C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Biochemistry, molecular biology (92C40)

Related Items (1)

Local protein threading by mixed integer programming

Uses Software

• RAPTOR

Cites Work

• On the approximation of protein threading
• Protein Threading: From Mathematical Models to Parallel Implementations
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms

This page was built for publication: Lagrangian approaches for a class of matching problems in computational biology