BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

234 related articles for article (PubMed ID: 22759417)

  • 1. 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]  

  • 2. 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]  

  • 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. 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]  

  • 5. 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]  

  • 6. 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]  

  • 7. 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]  

  • 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. 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]  

  • 10. The gene tree delusion.
    Springer MS; Gatesy J
    Mol Phylogenet Evol; 2016 Jan; 94(Pt A):1-33. PubMed ID: 26238460
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Statistical inconsistency of the unrooted minimize deep coalescence criterion.
    Alanzi AAR; Degnan JH
    PLoS One; 2021; 16(5):e0251107. PubMed ID: 33970931
    [TBL] [Abstract][Full Text] [Related]  

  • 12. 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]  

  • 13. A new fast method for inferring multiple consensus trees using k-medoids.
    Tahiri N; Willems M; Makarenkov V
    BMC Evol Biol; 2018 Apr; 18(1):48. PubMed ID: 29621975
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Partitioned coalescence support reveals biases in species-tree methods and detects gene trees that determine phylogenomic conflicts.
    Gatesy J; Sloan DB; Warren JM; Baker RH; Simmons MP; Springer MS
    Mol Phylogenet Evol; 2019 Oct; 139():106539. PubMed ID: 31226465
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Phylogenetic analysis at deep timescales: unreliable gene trees, bypassed hidden support, and the coalescence/concatalescence conundrum.
    Gatesy J; Springer MS
    Mol Phylogenet Evol; 2014 Nov; 80():231-66. PubMed ID: 25152276
    [TBL] [Abstract][Full Text] [Related]  

  • 16. What is the danger of the anomaly zone for empirical phylogenetics?
    Huang H; Knowles LL
    Syst Biol; 2009 Oct; 58(5):527-36. PubMed ID: 20525606
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Unconstrained Diameters for Deep Coalescence.
    Pawel Gorecki P; Paszek J; Eulenstein O
    IEEE/ACM Trans Comput Biol Bioinform; 2017; 14(5):1002-1012. PubMed ID: 26887001
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Minimizing the deep coalescence cost.
    Dąbkowski D; Tabaszewski P; Górecki P
    J Bioinform Comput Biol; 2018 Oct; 16(5):1840021. PubMed ID: 30419782
    [TBL] [Abstract][Full Text] [Related]  

  • 19. 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]  

  • 20. 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]  

    [Next]    [New Search]
    of 12.