2017
DOI: 10.1145/3088512
|View full text |Cite
|
Sign up to set email alerts
|

Reconciliation With Nonbinary Gene Trees Revisited

Abstract: By reconciling the phylogenetic tree of a gene family with the corresponding species tree, it is possible to infer lineage-specific duplications and losses with high confidence and hence annotate orthologs and paralogs. However, the currently available reconciliation methods for non-binary gene trees are too computationally expensive to be applied on a genomic level. Here, we present an O(m + n) algorithm to reconcile an arbitrary gene tree with its corresponding species tree, where m and n are the number of n… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2018
2018
2019
2019

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 41 publications
0
1
0
Order By: Relevance
“…The problem of reconciliation between a polytomous gene tree and a binary species tree minimizing the number of mutations (duplications + losses) is polynomial (Chang and Eulenstein 2006;Lafond et al 2012). In Zheng and Zhang (2017), O(|G| + |S|) algorithms for reconciling a nonbinary gene tree and a binary species tree in the duplication, loss, mutation, and deep coalescence models are given.…”
Section: A Review Of Some Previous Resultsmentioning
confidence: 99%
“…The problem of reconciliation between a polytomous gene tree and a binary species tree minimizing the number of mutations (duplications + losses) is polynomial (Chang and Eulenstein 2006;Lafond et al 2012). In Zheng and Zhang (2017), O(|G| + |S|) algorithms for reconciling a nonbinary gene tree and a binary species tree in the duplication, loss, mutation, and deep coalescence models are given.…”
Section: A Review Of Some Previous Resultsmentioning
confidence: 99%