Lagrangian Approaches for a class of Matching Problems in Computational Biology

Nicola Yanev 1 Rumen Andonov 1 Philippe Veber 1 Stefan Balev 2
1 SYMBIOSE - Biological systems and models, bioinformatics and sequences
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
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 :
Rapport
[Research Report] RR-5973, INRIA. 2006
Liste complète des métadonnées

Littérature citée [2 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00090635
Contributeur : Rapport de Recherche Inria <>
Soumis le : jeudi 7 septembre 2006 - 15:00:35
Dernière modification le : mercredi 18 avril 2018 - 11:06:39
Document(s) archivé(s) le : lundi 20 septembre 2010 - 16:17:31

Fichiers

Identifiants

Citation

Nicola Yanev, Rumen Andonov, Philippe Veber, Stefan Balev. Lagrangian Approaches for a class of Matching Problems in Computational Biology. [Research Report] RR-5973, INRIA. 2006. 〈inria-00090635v2〉

Partager

Métriques

Consultations de la notice

258

Téléchargements de fichiers

92