159 related articles for article (PubMed ID: 19407347)
1. The gene-duplication problem: near-linear time algorithms for NNI-based local searches.
Bansal MS; Eulenstein O; Wehe A
IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(2):221-31. PubMed ID: 19407347
[TBL] [Abstract][Full Text] [Related]
2. An Omega(n2/ log n) speed-up of TBR heuristics for the gene-duplication problem.
Bansal MS; Eulenstein O
IEEE/ACM Trans Comput Biol Bioinform; 2008; 5(4):514-24. PubMed ID: 18989039
[TBL] [Abstract][Full Text] [Related]
3. Triplet supertree heuristics for the tree of life.
Lin HT; Burleigh JG; Eulenstein O
BMC Bioinformatics; 2009 Jan; 10 Suppl 1(Suppl 1):S8. PubMed ID: 19208181
[TBL] [Abstract][Full Text] [Related]
4. Efficient algorithms for knowledge-enhanced supertree and supermatrix phylogenetic problems.
Wehe A; Burleigh JG; Eulenstein O
IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(6):1432-41. PubMed ID: 24407302
[TBL] [Abstract][Full Text] [Related]
5. Consensus properties and their large-scale applications for the gene duplication problem.
Moon J; Lin HT; Eulenstein O
J Bioinform Comput Biol; 2016 Jun; 14(3):1642005. PubMed ID: 27122201
[TBL] [Abstract][Full Text] [Related]
6. Exact solutions for species tree inference from discordant gene trees.
Chang WC; Górecki P; Eulenstein O
J Bioinform Comput Biol; 2013 Oct; 11(5):1342005. PubMed ID: 24131054
[TBL] [Abstract][Full Text] [Related]
7. The prevalence of multifurcations in tree-space and their implications for tree-search.
Whelan S; Money D
Mol Biol Evol; 2010 Dec; 27(12):2674-7. PubMed ID: 20584772
[TBL] [Abstract][Full Text] [Related]
8. Efficient Local Search for Euclidean Path-Difference Median Trees.
Markin A; Eulenstein O
IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(4):1374-1385. PubMed ID: 29035224
[TBL] [Abstract][Full Text] [Related]
9. 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]
10. Progressive tree neighborhood applied to the maximum parsimony problem.
Goëffon A; Richer JM; Hao JK
IEEE/ACM Trans Comput Biol Bioinform; 2008; 5(1):136-45. PubMed ID: 18245882
[TBL] [Abstract][Full Text] [Related]
11. Linear-time algorithms for the multiple gene duplication problems.
Luo CW; Chen MC; Chen YC; Yang RW; Liu HF; Chao KM
IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(1):260-5. PubMed ID: 21071814
[TBL] [Abstract][Full Text] [Related]
12. Synthesizing large-scale species trees using the strict consensus approach.
Moon J; Eulenstein O
J Bioinform Comput Biol; 2017 Jun; 15(3):1740002. PubMed ID: 28513253
[TBL] [Abstract][Full Text] [Related]
13. Characterizing the phylogenetic tree-search problem.
Money D; Whelan S
Syst Biol; 2012 Mar; 61(2):228-39. PubMed ID: 22076302
[TBL] [Abstract][Full Text] [Related]
14. Walks on SPR neighborhoods.
Caceres AJ; Castillo J; Lee J; St John K
IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(1):236-9. PubMed ID: 23702562
[TBL] [Abstract][Full Text] [Related]
15. 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]
16. An ILP solution for the gene duplication problem.
Chang WC; Burleigh GJ; Fernández-Baca DF; Eulenstein O
BMC Bioinformatics; 2011 Feb; 12 Suppl 1(Suppl 1):S14. PubMed ID: 21342543
[TBL] [Abstract][Full Text] [Related]
17. Cophenetic Median Trees.
Markin A; Eulenstein O
IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(5):1459-1470. PubMed ID: 30222583
[TBL] [Abstract][Full Text] [Related]
18. Large-scale analysis of phylogenetic search behavior.
Park HJ; Sul SJ; Williams TL
Adv Exp Med Biol; 2010; 680():35-42. PubMed ID: 20865484
[TBL] [Abstract][Full Text] [Related]
19. Neighborhoods of trees in circular orderings.
Bastkowski S; Moulton V; Spillner A; Wu T
Bull Math Biol; 2015 Jan; 77(1):46-70. PubMed ID: 25477080
[TBL] [Abstract][Full Text] [Related]
20. 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]
[Next] [New Search]