2009
DOI: 10.1089/cmb.2009.0095
|View full text |Cite
|
Sign up to set email alerts
|

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, … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

4
67
0

Year Published

2010
2010
2019
2019

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 42 publications
(71 citation statements)
references
References 18 publications
4
67
0
Order By: Relevance
“…While there exists previous work on exploring and summarizing the reconciliation space, they consider only duplications and losses (Arvestad et al 2004;Doyon et al 2008Doyon et al , 2009Doyon et al , 2012 or additionally horizontal gene transfer (Scornavacca et al 2013), or, if ILS is addressed, they model only a subset of the evolutionary histories that are possible in our model (Vernot et al 2007). That is, this work presents the first approach for fully exploring the reconciliation space while accounting for duplications, losses, and ILS.…”
Section: Discussionmentioning
confidence: 99%
“…While there exists previous work on exploring and summarizing the reconciliation space, they consider only duplications and losses (Arvestad et al 2004;Doyon et al 2008Doyon et al , 2009Doyon et al , 2012 or additionally horizontal gene transfer (Scornavacca et al 2013), or, if ILS is addressed, they model only a subset of the evolutionary histories that are possible in our model (Vernot et al 2007). That is, this work presents the first approach for fully exploring the reconciliation space while accounting for duplications, losses, and ILS.…”
Section: Discussionmentioning
confidence: 99%
“…The MPR represents the mapping between each gene-tree vertex to either a species tree vertex (speciation) or to a species tree edge (gene duplication) in a parsimonious way (minimizing the number of duplications). The MPR is preferred to other reconciliations, because in most cases the MPR represents the true reconciliation between gene tree and the species tree [36, 37]. …”
Section: Methodsmentioning
confidence: 99%
“…In the present context, we are thus motivated to define larger classes of reconciliations, including M (T, S), but also sub-optimal solutions (with respect to the number of duplications) [38,54,55,89]. This allows to explore a larger space of reconciliations and alternative evolutionary scenarios for gene families.…”
Section: Optimization Criteriamentioning
confidence: 99%