title: Space of gene/species trees reconciliations and parsimonious models.
abstract: We describe algorithms to study the space of all possible reconciliations between a gene tree and a species tree, that is counting the size of this space, uniformly generate a random reconciliation, and exploring this space in optimal time using combinatorial operators. We also extend these algorithms for optimal and sub-optimal reconciliations according to the three usual combinatorial costs (duplication, loss, and mutation). Applying these algorithms to simulated and real gene family evolutionary scenarios, we observe that the LCA (Last Common Ancestor) based reconciliation is almost always identical to the real one.
authors.affiliation: DIRO, Université de Montréal, Montréal, Quebec, Canada.
authors.forename: Jean-Philippe
authors.initials: JP
authors.lastname: Doyon
authors.forename: Cedric
authors.initials: C
authors.lastname: Chauve
authors.forename: Sylvie
authors.initials: S
authors.lastname: Hamel
mesh_terms: D000465:Algorithms; D000818:Animals; D004330:Drosophila / Q000145:classification / Q000235:genetics; D019143:Evolution, Molecular; D049810:Genetic Speciation; D016678:Genome; D006801:Humans; D008957:Models, Genetic; D010802:Phylogeny