These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

162 related articles for article (PubMed ID: 19426451)

  • 1. Using tree diversity to compare phylogenetic heuristics.
    Sul SJ; Matthews S; Williams TL
    BMC Bioinformatics; 2009 Apr; 10 Suppl 4(Suppl 4):S3. PubMed ID: 19426451
    [TBL] [Abstract][Full Text] [Related]  

  • 2. PRec-I-DCM3: a parallel framework for fast and accurate large-scale phylogeny reconstruction.
    Dotsenko Y; Coarfa C; Nakhleh L; Mellor-Crummey J; Roshan U
    Int J Bioinform Res Appl; 2006; 2(4):407-19. PubMed ID: 18048181
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Rec-I-DCM3: a fast algorithmic technique for reconstructing large phylogenetic trees.
    Roshan UW; Moret BM; Warnow T; Williams TL
    Proc IEEE Comput Syst Bioinform Conf; 2004; ():98-109. PubMed ID: 16448004
    [TBL] [Abstract][Full Text] [Related]  

  • 4. On divide-and-conquer strategies for parsimony analysis of large data sets: Rec-I-DCM3 versus TNT.
    Goloboff PA; Pol D
    Syst Biol; 2007 Jun; 56(3):485-95. PubMed ID: 17562472
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Fast local search for unrooted Robinson-Foulds supertrees.
    Chaudhary R; Burleigh JG; Fernández-Baca D
    IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(4):1004-13. PubMed ID: 22431553
    [TBL] [Abstract][Full Text] [Related]  

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

  • 7. Rec-DCM-Eigen: reconstructing a less parsimonious but more accurate tree in shorter time.
    Kang S; Tang J; Schaeffer SW; Bader DA
    PLoS One; 2011; 6(8):e22483. PubMed ID: 21887219
    [TBL] [Abstract][Full Text] [Related]  

  • 8. New approaches to phylogenetic tree search and their application to large numbers of protein alignments.
    Whelan S
    Syst Biol; 2007 Oct; 56(5):727-40. PubMed ID: 17849327
    [TBL] [Abstract][Full Text] [Related]  

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

  • 10. Invariant transformers of Robinson and Foulds distance matrices for Convolutional Neural Network.
    Tahiri N; Veriga A; Koshkarov A; Morozov B
    J Bioinform Comput Biol; 2022 Aug; 20(4):2250012. PubMed ID: 35798684
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 13. Asymmetric Cluster-Based Measures for Comparative Phylogenetics.
    Wagle S; Markin A; Górecki P; Anderson TK; Eulenstein O
    J Comput Biol; 2024 Apr; 31(4):312-327. PubMed ID: 38634854
    [No Abstract]   [Full Text] [Related]  

  • 14. A polynomial-time algorithm computing lower and upper bounds of the rooted subtree prune and regraft distance.
    Kannan L; Li H; Mushegian A
    J Comput Biol; 2011 May; 18(5):743-57. PubMed ID: 21166560
    [TBL] [Abstract][Full Text] [Related]  

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

  • 16. Better methods for solving parsimony and compatibility.
    Bonet M; Steel M; Warnow T; Yooseph S
    J Comput Biol; 1998; 5(3):391-407. PubMed ID: 9773340
    [TBL] [Abstract][Full Text] [Related]  

  • 17. The
    Khayatian E; Valiente G; Zhang L
    J Comput Biol; 2024 Apr; 31(4):328-344. PubMed ID: 38271573
    [No Abstract]   [Full Text] [Related]  

  • 18. DTL reconciliation repair.
    Ma W; Smirnov D; Libeskind-Hadas R
    BMC Bioinformatics; 2017 Mar; 18(Suppl 3):76. PubMed ID: 28361686
    [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. The Generalized Robinson-Foulds Distance for Phylogenetic Trees.
    Llabrés M; Rosselló F; Valiente G
    J Comput Biol; 2021 Dec; 28(12):1181-1195. PubMed ID: 34714118
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 9.