257 related articles for article (PubMed ID: 21576759)
1. 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]
2. Inferring incomplete lineage sorting, duplications, transfers and losses with reconciliations.
Chan YB; Ranwez V; Scornavacca C
J Theor Biol; 2017 Nov; 432():1-13. PubMed ID: 28801222
[TBL] [Abstract][Full Text] [Related]
3. Consistency properties of species tree inference by minimizing deep coalescences.
Than CV; Rosenberg NA
J Comput Biol; 2011 Jan; 18(1):1-15. PubMed ID: 21210728
[TBL] [Abstract][Full Text] [Related]
4. Estimating optimal species trees from incomplete gene trees under deep coalescence.
Bayzid MS; Warnow T
J Comput Biol; 2012 Jun; 19(6):591-605. PubMed ID: 22697236
[TBL] [Abstract][Full Text] [Related]
5. 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]
6. 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]
7. 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]
8. 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]
9. 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]
10. Assessing approaches for inferring species trees from multi-copy genes.
Chaudhary R; Boussau B; Burleigh JG; Fernández-Baca D
Syst Biol; 2015 Mar; 64(2):325-39. PubMed ID: 25540456
[TBL] [Abstract][Full Text] [Related]
11. 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]
12. On the computational complexity of the maximum parsimony reconciliation problem in the duplication-loss-coalescence model.
Bork D; Cheng R; Wang J; Sung J; Libeskind-Hadas R
Algorithms Mol Biol; 2017; 12():6. PubMed ID: 28316640
[TBL] [Abstract][Full Text] [Related]
13. 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]
14. Mathematical properties of the deep coalescence cost.
Than CV; Rosenberg NA
IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(1):61-72. PubMed ID: 23702544
[TBL] [Abstract][Full Text] [Related]
15. A matter of phylogenetic scale: Distinguishing incomplete lineage sorting from lateral gene transfer as the cause of gene tree discord in recent versus deep diversification histories.
Knowles LL; Huang H; Sukumaran J; Smith SA
Am J Bot; 2018 Mar; 105(3):376-384. PubMed ID: 29710372
[TBL] [Abstract][Full Text] [Related]
16. Maximizing Deep Coalescence Cost.
Górecki P; Eulenstein O
IEEE/ACM Trans Comput Biol Bioinform; 2014; 11(1):231-42. PubMed ID: 26355521
[TBL] [Abstract][Full Text] [Related]
17. 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]
18. 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]
19. 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]
20. On the Complexity of Duplication-Transfer-Loss Reconciliation with Non-Binary Gene Trees.
Kordi M; Bansal MS
IEEE/ACM Trans Comput Biol Bioinform; 2017; 14(3):587-599. PubMed ID: 28055898
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
