arXiv · q-bio/0609001
Lagrangian Approaches for a class of Matching Problems in Computational Biology
Abstract
This paper presents efficient algorithms for solving the problem of aligning a protein structure template to a query amino-acid sequence, known as protein threading problem. We consider the problem as a special case of graph matching problem. We give formal graph and integer programming models of the problem. After studying the properties of these models, we propose two kinds of Lagrangian relaxation for solving them. We present experimental results on real life instances showing the efficiency of our approaches.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Nicola Yanev, Rumen Andonov, Philippe Veber, Stefan Balev. 2006-09-01. Lagrangian Approaches for a class of Matching Problems in Computational Biology. https://arxiv.org/abs/q-bio/0609001
Cite the original work for its findings. Save a collection to share your selection of sources.