2013
DOI: 10.1186/1471-2105-14-s15-s5
|View full text |Cite
|
Sign up to set email alerts
|

Gene tree correction guided by orthology

Abstract: BackgroundReconciled gene trees yield orthology and paralogy relationships between genes. This information may however contradict other information on orthology and paralogy provided by other footprints of evolution, such as conserved synteny.ResultsWe explore a way to include external information on orthology in the process of gene tree construction. Given an initial gene tree and a set of orthology constraints on pairs of genes or on clades, we give polynomial-time algorithms for producing a modified gene tr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
28
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
5
2
1

Relationship

2
6

Authors

Journals

citations
Cited by 26 publications
(28 citation statements)
references
References 24 publications
0
28
0
Order By: Relevance
“…Most importantly, in its current form, it can only handle binary trees, which reduces its ability to handle gene tree error [47]. While A-Pro is more robust to gene tree error than alternatives, combining it with co-estimation [3] and tree fixing [72][73][74][75][76][77] may further improve its accuracy. Future work should also explore ways to extend A-Pro so that it can handle polytomies in input gene trees.…”
Section: Discussionmentioning
confidence: 99%
“…Most importantly, in its current form, it can only handle binary trees, which reduces its ability to handle gene tree error [47]. While A-Pro is more robust to gene tree error than alternatives, combining it with co-estimation [3] and tree fixing [72][73][74][75][76][77] may further improve its accuracy. Future work should also explore ways to extend A-Pro so that it can handle polytomies in input gene trees.…”
Section: Discussionmentioning
confidence: 99%
“…We generated 960 random instances with forests of sizes ranging between 5 and 100 (10 instances for each 5n100). We compared the output of Algorithm MinNADref with that of Algorithm MinDLref, given in (Lafond et al , 2012), which computes refinement minimizing the duplication+loss ( DL ) cost of reconciliation with the species tree. Both algorithms gave the exact same refinement for only 12 instances (1.25%).…”
Section: Resultsmentioning
confidence: 99%
“…Genome 460 organisation information still remains difficult to incorporate in gene phylogenies, largely due to the lack of well-supported evolutionary models (Chauve et al 2013) and the need for contiguous genome assemblies. The most notable effort to use extant synteny to correct gene trees in a general context showed mixed results (ParalogyCorrector within the RefineTree framework (Lafond et al 2013;Noutahi et al 2016)). However, we show here that in contexts 465…”
Section: Discussionmentioning
confidence: 99%
“…Second, we included the original, uncorrected trees from Ensembl Compara (Vilella et al 2009), which are phylogeny-reconciled 280 consensus trees build with the TreeBeST pipeline. Last, we tested ParalogyCorrector, the only other existing methodology that corrects gene trees using synteny information (Lafond et al 2013). To compute ParalogyCorrector trees, we provided our synteny-derived orthologies constraints along with the original Ensembl subtree.…”
Section: Validation Of Scorpios Trees and Comparison To Existing Methmentioning
confidence: 99%
See 1 more Smart Citation