 |
 |
|
|
| HAL : lirmm-00448481, version 2 |
| Fiche détaillée |  Récupérer au format |
|
|
| N° RR-10001 (2010) 18 |
|
|
| Versions disponibles : | v1 (22-01-2010) | v2 (04-05-2010) |
|
|
|
|
| Branch-and-Bound Approach for Parsimonious Inference of a Species Tree From a Set of Gene Family Trees |
|
|
Jean-Philippe Doyon 1Cedric Chauve 2 |
|
|
| (19/01/2010) |
|
|
|
| We describe a Branch-and-Bound algorithm for computing a parsimonious species tree given a set of gene family trees. Our algorithm can compute a parsimonious species tree for three cost measures: number of gene duplications, number of gene losses, and both combined. Moreover, to cope with intrinsic limitations of Branch-and-Bound algorithms for species trees inference regarding the number of taxa that can be considered, our algorithm can naturally take into account predefined relationships between sets of taxa. We test our algorithm on a dataset of eukaryotic gene families spanning 29 taxa. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM) |
|
|
|
CNRS : UMR5506 – Université Montpellier II - Sciences et Techniques du Languedoc |
|
|
| 2 : | Department of Mathematics |
|
|
|
Simon Fraser University |
|
|
|
|
|
|
|
|
|
| [INFO/MAB : Méthodes et Algorithmes pour la Bioinformatique] |
|
|
|
|
| Domaine | : | Informatique/Bio-informatique Sciences du Vivant/Bio-Informatique, Biologie Systémique |
|
|
| Comparative genomics – Evolution and phylogenetics |
|
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|||||
|
|
|
| lirmm-00448481, version 2 | |
| http://hal-lirmm.ccsd.cnrs.fr/lirmm-00448481 | |
| oai:hal-lirmm.ccsd.cnrs.fr:lirmm-00448481 | |
| Contributeur : Jean-Philippe Doyon | |
| Soumis le : Lundi 3 Mai 2010, 12:28:09 | |
| Dernière modification le : Mardi 4 Mai 2010, 17:19:09 | |
