An efficient algorithm for gene species trees parsimonious reconciliation with losses duplications and transfers

An efficient algorithm for gene/species trees parsimonious reconciliation with losses, duplications, and transfers Jean-Philippe DOYON1, Celine SCORNAVACCA2, Gergely J. SZOLLO˝SI3 , Vincent Ranwez4 and Vincent Berry1 1 LIRMM, CNRS - Univ. Montpellier 2, France. 2 Center for Bioinformatics (ZBIT), Tuebingen Univ., Germany. 3 LBBE, CNRS - Univ. Lyon 1, France. 4 ISEM, CNRS - Univ. Montpellier 2, France. Abstract (Motivation) Tree reconciliation is an approach that explains the discrepancies between two evolutionary trees by a number of events such as speciations, duplications, transfers and losses. It has important applications in ecology, biogeography and genomics, for instance to decipher relationships between homologous sequences. (Results) We provide a fast and exact reconciliation algorithm according to a parsimony criterion that considers duplication, transfer and loss events. We also present experimental results that give first insights on the conditions under which parsimony is able to accurately infer evolutionary scenarios involving such events. Over all, parsimony performs well under realistic cases, as well as for relatively high duplication and transfer rates. As expected, transfers are in general less accurately recovered than duplications. Availability: Keywords reconciliation, gene and species trees, transfers, duplications, losses, parsimony. Un algorithme de parcimonie efficace pour la reconciliation d'arbres de genes/especes avec pertes, duplications et transferts Resume (Motivation) La reconciliation d'arbres est une approche qui permet d'expliquer les differences entre deux arbres evolutifs par le biais d'evenements

• reconciliation


• transfert


• probleme mpr


• arbre de genes


• evenements dtls


• cout


• s?


• algorithme efficace pour mpr base