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 *

179 related articles for article (PubMed ID: 25657329)

  • 21. Imputing supertrees and supernetworks from quartets.
    Holland B; Conner G; Huber K; Moulton V
    Syst Biol; 2007 Feb; 56(1):57-67. PubMed ID: 17366137
    [TBL] [Abstract][Full Text] [Related]  

  • 22. PhySIC: a veto supertree method with desirable properties.
    Ranwez V; Berry V; Criscuolo A; Fabre PH; Guillemot S; Scornavacca C; Douzery EJ
    Syst Biol; 2007 Oct; 56(5):798-817. PubMed ID: 17918032
    [TBL] [Abstract][Full Text] [Related]  

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

  • 24. PhySIC_IST: cleaning source trees to infer more informative supertrees.
    Scornavacca C; Berry V; Lefort V; Douzery EJ; Ranwez V
    BMC Bioinformatics; 2008 Oct; 9():413. PubMed ID: 18834542
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Trees from trees: construction of phylogenetic supertrees using clann.
    Creevey CJ; McInerney JO
    Methods Mol Biol; 2009; 537():139-61. PubMed ID: 19378143
    [TBL] [Abstract][Full Text] [Related]  

  • 26. Nodal distances for rooted phylogenetic trees.
    Cardona G; Llabrés M; Rosselló F; Valiente G
    J Math Biol; 2010 Aug; 61(2):253-276. PubMed ID: 19760227
    [TBL] [Abstract][Full Text] [Related]  

  • 27. SuperTRI: A new approach based on branch support analyses of multiple independent data sets for assessing reliability of phylogenetic inferences.
    Ropiquet A; Li B; Hassanin A
    C R Biol; 2009 Sep; 332(9):832-47. PubMed ID: 19748458
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Generalization of Phylogenetic Matching Metrics with Experimental Tests of Practical Advantages.
    Bogdanowicz D; Giaro K
    J Comput Biol; 2023 Mar; 30(3):261-276. PubMed ID: 36576792
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees.
    Baste J; Paul C; Sau I; Scornavacca C
    Bull Math Biol; 2017 Apr; 79(4):920-938. PubMed ID: 28247121
    [TBL] [Abstract][Full Text] [Related]  

  • 30. constNJ: an algorithm to reconstruct sets of phylogenetic trees satisfying pairwise topological constraints.
    Matsen FA
    J Comput Biol; 2010 Jun; 17(6):799-818. PubMed ID: 20500096
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Gene Tree Construction and Correction Using SuperTree and Reconciliation.
    Lafond M; Chauve C; El-Mabrouk N; Ouangraoua A
    IEEE/ACM Trans Comput Biol Bioinform; 2018; 15(5):1560-1570. PubMed ID: 28678712
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Accuracy of estimated phylogenetic trees from molecular data. II. Gene frequency data.
    Nei M; Tajima F; Tateno Y
    J Mol Evol; 1983; 19(2):153-70. PubMed ID: 6571220
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Using supermatrices for phylogenetic inquiry: an example using the sedges.
    Hinchliff CE; Roalson EH
    Syst Biol; 2013 Mar; 62(2):205-19. PubMed ID: 23103590
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Linear-time algorithms for phylogenetic tree completion under Robinson-Foulds distance.
    Bansal MS
    Algorithms Mol Biol; 2020; 15():6. PubMed ID: 32313549
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Minimum-flip supertrees: complexity and algorithms.
    Chen D; Eulenstein O; Fernandez-Baca D; Sanderson M
    IEEE/ACM Trans Comput Biol Bioinform; 2006; 3(2):165-73. PubMed ID: 17048402
    [TBL] [Abstract][Full Text] [Related]  

  • 36. SPRIT: Identifying horizontal gene transfer in rooted phylogenetic trees.
    Hill T; Nordström KJ; Thollesson M; Säfström TM; Vernersson AK; Fredriksson R; Schiöth HB
    BMC Evol Biol; 2010 Feb; 10():42. PubMed ID: 20152048
    [TBL] [Abstract][Full Text] [Related]  

  • 37. SATe-II: very fast and accurate simultaneous estimation of multiple sequence alignments and phylogenetic trees.
    Liu K; Warnow TJ; Holder MT; Nelesen SM; Yu J; Stamatakis AP; Linder CR
    Syst Biol; 2012 Jan; 61(1):90-106. PubMed ID: 22139466
    [TBL] [Abstract][Full Text] [Related]  

  • 38. SuperQ: computing supernetworks from quartets.
    Grünewald S; Spillner A; Bastkowski S; Bögershausen A; Moulton V
    IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(1):151-60. PubMed ID: 23702551
    [TBL] [Abstract][Full Text] [Related]  

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

  • 40. Analyzing Phylogenetic Trees with a Tree Lattice Coordinate System and a Graph Polynomial.
    Liu P; Biller P; Gould M; Colijn C
    Syst Biol; 2022 Oct; 71(6):1378-1390. PubMed ID: 35169849
    [TBL] [Abstract][Full Text] [Related]  

    [Previous]   [Next]    [New Search]
    of 9.