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.
Type de document :
Article dans une revue
Computers and Mathematics with Applications, Elsevier, 2008, 55 (Issue 5 (March 2008)), pp.1054-1067. 〈10.1016/j.camwa.2006.12.103〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00335126
Contributeur : Rumen Andonov <>
Soumis le : mardi 28 octobre 2008 - 15:16:59
Dernière modification le : mercredi 18 avril 2018 - 11:06:39

Lien texte intégral

Identifiants

Citation

Nicola Yanev, Rumen Andonov, Philippe Veber, Stefan Balev. Lagrangian approaches for a class of matching problems in computational biology. Computers and Mathematics with Applications, Elsevier, 2008, 55 (Issue 5 (March 2008)), pp.1054-1067. 〈10.1016/j.camwa.2006.12.103〉. 〈inria-00335126〉

Partager

Métriques

Consultations de la notice

223