263 related articles for article (PubMed ID: 20122216)
1. Efficient genome-scale phylogenetic analysis under the duplication-loss and deep coalescence cost models.
Bansal MS; Burleigh JG; Eulenstein O
BMC Bioinformatics; 2010 Jan; 11 Suppl 1(Suppl 1):S42. PubMed ID: 20122216
[TBL] [Abstract][Full Text] [Related]
2. Algorithms for genome-scale phylogenetics using gene tree parsimony.
Bansal MS; Eulenstein O
IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(4):939-56. PubMed ID: 24334388
[TBL] [Abstract][Full Text] [Related]
3. Efficient error correction algorithms for gene tree reconciliation based on duplication, duplication and loss, and deep coalescence.
Chaudhary R; Burleigh JG; Eulenstein O
BMC Bioinformatics; 2012 Jun; 13 Suppl 10(Suppl 10):S11. PubMed ID: 22759416
[TBL] [Abstract][Full Text] [Related]
4. iGTP: a software package for large-scale gene tree parsimony analysis.
Chaudhary R; Bansal MS; Wehe A; Fernández-Baca D; Eulenstein O
BMC Bioinformatics; 2010 Nov; 11():574. PubMed ID: 21092314
[TBL] [Abstract][Full Text] [Related]
5. From gene trees to species trees II: species tree inference by minimizing deep coalescence events.
Zhang L
IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(6):1685-91. PubMed ID: 21576759
[TBL] [Abstract][Full Text] [Related]
6. Algorithms: simultaneous error-correction and rooting for gene tree reconciliation and the gene duplication problem.
Górecki P; Eulenstein O
BMC Bioinformatics; 2012 Jun; 13 Suppl 10(Suppl 10):S14. PubMed ID: 22759419
[TBL] [Abstract][Full Text] [Related]
7. Multiple Optimal Reconciliations Under the Duplication-Loss-Coalescence Model.
Du H; Ong YS; Knittel M; Mawhorter R; Liu N; Gross G; Tojo R; Libeskind-Hadas R; Wu YC
IEEE/ACM Trans Comput Biol Bioinform; 2021; 18(6):2144-2156. PubMed ID: 31199267
[TBL] [Abstract][Full Text] [Related]
8. Structural properties of the reconciliation space and their applications in enumerating nearly-optimal reconciliations between a gene tree and a species tree.
Wu T; Zhang L
BMC Bioinformatics; 2011 Oct; 12 Suppl 9(Suppl 9):S7. PubMed ID: 22151151
[TBL] [Abstract][Full Text] [Related]
9. Most parsimonious reconciliation in the presence of gene duplication, loss, and deep coalescence using labeled coalescent trees.
Wu YC; Rasmussen MD; Bansal MS; Kellis M
Genome Res; 2014 Mar; 24(3):475-86. PubMed ID: 24310000
[TBL] [Abstract][Full Text] [Related]
10. Consensus properties for the deep coalescence problem and their application for scalable tree search.
Lin HT; Burleigh JG; Eulenstein O
BMC Bioinformatics; 2012 Jun; 13 Suppl 10(Suppl 10):S12. PubMed ID: 22759417
[TBL] [Abstract][Full Text] [Related]
11. Are the duplication cost and Robinson-Foulds distance equivalent?
Zheng Y; Zhang L
J Comput Biol; 2014 Aug; 21(8):578-90. PubMed ID: 24988427
[TBL] [Abstract][Full Text] [Related]
12. Reconciliation with non-binary species trees.
Vernot B; Stolzer M; Goldman A; Durand D
J Comput Biol; 2008 Oct; 15(8):981-1006. PubMed ID: 18808330
[TBL] [Abstract][Full Text] [Related]
13. Inferring Pareto-optimal reconciliations across multiple event costs under the duplication-loss-coalescence model.
Mawhorter R; Liu N; Libeskind-Hadas R; Wu YC
BMC Bioinformatics; 2019 Dec; 20(Suppl 20):639. PubMed ID: 31842732
[TBL] [Abstract][Full Text] [Related]
14. The Unconstrained Diameters of the Duplication-Loss Cost and the Loss Cost.
Gorecki P; Eulenstein O; Tiuryn J
IEEE/ACM Trans Comput Biol Bioinform; 2021; 18(6):2125-2135. PubMed ID: 31150345
[TBL] [Abstract][Full Text] [Related]
15. Maximum parsimony reconciliation in the DTLOR model.
Liu J; Mawhorter R; Liu N; Santichaivekin S; Bush E; Libeskind-Hadas R
BMC Bioinformatics; 2021 Aug; 22(Suppl 10):394. PubMed ID: 34348661
[TBL] [Abstract][Full Text] [Related]
16. Inferring Optimal Species Trees in the Presence of Gene Duplication and Loss: Beyond Rooted Gene Trees.
Bayzid MS
J Comput Biol; 2023 Feb; 30(2):161-175. PubMed ID: 36251762
[TBL] [Abstract][Full Text] [Related]
17. Exact median-tree inference for unrooted reconciliation costs.
Górecki P; Markin A; Eulenstein O
BMC Evol Biol; 2020 Oct; 20(Suppl 1):136. PubMed ID: 33115401
[TBL] [Abstract][Full Text] [Related]
18. Reconciliation feasibility in the presence of gene duplication, loss, and coalescence with multiple individuals per species.
Rogers J; Fishberg A; Youngs N; Wu YC
BMC Bioinformatics; 2017 Jun; 18(1):292. PubMed ID: 28583091
[TBL] [Abstract][Full Text] [Related]
19. Reconciliation with non-binary species trees.
Vernot B; Stolzer M; Goldman A; Durand D
Comput Syst Bioinformatics Conf; 2007; 6():441-52. PubMed ID: 17951846
[TBL] [Abstract][Full Text] [Related]
20. Maximum likelihood models and algorithms for gene tree evolution with duplications and losses.
Górecki P; Burleigh GJ; Eulenstein O
BMC Bioinformatics; 2011 Feb; 12 Suppl 1(Suppl 1):S15. PubMed ID: 21342544
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
