 |
 |
|
|
| HAL : lirmm-00503994, version 1 |
| Fiche détaillée |  Récupérer au format |
|
|
| N° RR-10021 (2010) |
|
|
|
|
| An Efficient Algorithm for Gene/Species Trees Parsimonious Reconciliation with Losses, Duplications and Transfers |
|
|
| Jean-Philippe Doyon 1Celine Scornavacca 2 |
|
|
| (19/07/2010) |
|
|
|
| Tree reconciliation methods aim at estimating the evolutionary events that cause discrepancy between gene trees and species trees. We provide a discrete computational model that considers duplications, transfers and losses of genes. The model yields a fast and exact algorithm to infer time consistent and most parsimonious reconciliations. Then we study the conditions under which parsimony is able to accurately infer such events. Overall, it performs well even under realistic rates, transfers being in general less accurately recovered than duplications. An implementation is freely available at http://www.atgc-montpellier.fr/MPR. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM) |
|
|
|
CNRS : UMR5506 – Université Montpellier II - Sciences et Techniques du Languedoc |
|
|
| 2 : | Center for Bioinformatics (ZBIT) |
|
|
|
Tuebingen University |
|
|
| 3 : | LBBE, CNRS |
|
|
|
Université de Lyon |
|
|
| 4 : | Institut des Sciences de l'Evolution - Montpellier (ISEM) |
|
|
|
CNRS : UMR5554 – Université Montpellier II - Sciences et Techniques du Languedoc – IRD : UMR226 |
|
|
|
|
|
|
|
|
|
| [INFO/MAB : Méthodes et Algorithmes pour la Bioinformatique] |
|
|
|
|
| Domaine | : | Informatique/Bio-informatique Sciences du Vivant/Bio-Informatique, Biologie Systémique |
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|||||
|
|
|
| lirmm-00503994, version 1 | |
| http://hal-lirmm.ccsd.cnrs.fr/lirmm-00503994 | |
| oai:hal-lirmm.ccsd.cnrs.fr:lirmm-00503994 | |
| Contributeur : Isabelle Gouat | |
| Soumis le : Mardi 21 Septembre 2010, 10:15:13 | |
| Dernière modification le : Mercredi 22 Septembre 2010, 10:51:32 | |
