Lagrangian approaches for a class of matching problems in computational biology - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Computers & Mathematics with Applications Année : 2008

Lagrangian approaches for a class of matching problems in computational biology

Résumé

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.

Dates et versions

inria-00335126 , version 1 (28-10-2008)

Identifiants

Citer

Nicola Yanev, Rumen Andonov, Philippe Veber, Stefan Balev. Lagrangian approaches for a class of matching problems in computational biology. Computers & Mathematics with Applications, 2008, 55 (Issue 5 (March 2008)), pp.1054-1067. ⟨10.1016/j.camwa.2006.12.103⟩. ⟨inria-00335126⟩
151 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More