340 related articles for article (PubMed ID: 21092314)
1. 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]
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 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]
4. 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]
5. 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]
6. 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]
7. 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]
8. 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]
9. 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]
10. 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]
11. 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]
12. 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]
13. Inferring duplication episodes from unrooted gene trees.
Paszek J; Górecki P
BMC Genomics; 2018 May; 19(Suppl 5):288. PubMed ID: 29745844
[TBL] [Abstract][Full Text] [Related]
14. Efficient algorithms for the reconciliation problem with gene duplication, horizontal transfer and loss.
Bansal MS; Alm EJ; Kellis M
Bioinformatics; 2012 Jun; 28(12):i283-91. PubMed ID: 22689773
[TBL] [Abstract][Full Text] [Related]
15. 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]
16. Bijective Diameters of Gene Tree Parsimony Costs.
Gorecki P; Eulenstein O
IEEE/ACM Trans Comput Biol Bioinform; 2018; 15(5):1723-1727. PubMed ID: 28792904
[TBL] [Abstract][Full Text] [Related]
17. Optimal gene trees from sequences and species trees using a soft interpretation of parsimony.
Berglund-Sonnhammer AC; Steffansson P; Betts MJ; Liberles DA
J Mol Evol; 2006 Aug; 63(2):240-50. PubMed ID: 16830091
[TBL] [Abstract][Full Text] [Related]
18. 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]
19. 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]
20. 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]
[Next] [New Search]
