328 related articles for article (PubMed ID: 24334388)
1. 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]
2. 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]
3. 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]
4. 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]
5. DupTree: a program for large-scale phylogenetic analyses using gene tree parsimony.
Wehe A; Bansal MS; Burleigh JG; Eulenstein O
Bioinformatics; 2008 Jul; 24(13):1540-1. PubMed ID: 18474508
[TBL] [Abstract][Full Text] [Related]
6. Species Tree Inference Using a Mixture Model.
Ullah I; Parviainen P; Lagergren J
Mol Biol Evol; 2015 Sep; 32(9):2469-82. PubMed ID: 25963975
[TBL] [Abstract][Full Text] [Related]
7. 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]
8. 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]
9. On the impact of uncertain gene tree rooting on duplication-transfer-loss reconciliation.
Kundu S; Bansal MS
BMC Bioinformatics; 2018 Aug; 19(Suppl 9):290. PubMed ID: 30367593
[TBL] [Abstract][Full Text] [Related]
10. Locating large-scale gene duplication events through reconciled trees: implications for identifying ancient polyploidy events in plants.
Burleigh JG; Bansal MS; Wehe A; Eulenstein O
J Comput Biol; 2009 Aug; 16(8):1071-83. PubMed ID: 19689214
[TBL] [Abstract][Full Text] [Related]
11. 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]
12. 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]
13. 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]
14. 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]
15. Exact Algorithms for Duplication-Transfer-Loss Reconciliation with Non-Binary Gene Trees.
Kordi M; Bansal MS
IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(4):1077-1090. PubMed ID: 28622673
[TBL] [Abstract][Full Text] [Related]
16. Species Tree Estimation from Genome-Wide Data with guenomu.
de Oliveira Martins L; Posada D
Methods Mol Biol; 2017; 1525():461-478. PubMed ID: 27896732
[TBL] [Abstract][Full Text] [Related]
17. Effect of Incomplete Lineage Sorting On Tree-Reconciliation-Based Inference of Gene Duplication.
Zheng Y; Zhang L
IEEE/ACM Trans Comput Biol Bioinform; 2014; 11(3):477-85. PubMed ID: 26356016
[TBL] [Abstract][Full Text] [Related]
18. 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]
19. 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]
20. Inferring duplications, losses, transfers and incomplete lineage sorting with nonbinary species trees.
Stolzer M; Lai H; Xu M; Sathaye D; Vernot B; Durand D
Bioinformatics; 2012 Sep; 28(18):i409-i415. PubMed ID: 22962460
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
