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 *

149 related articles for article (PubMed ID: 33425487)

  • 21. Tie trees generated by distance methods of phylogenetic reconstruction.
    Takezaki N
    Mol Biol Evol; 1998 Jun; 15(6):727-37. PubMed ID: 9615454
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Efficiencies of different genes and different tree-building methods in recovering a known vertebrate phylogeny.
    Russo CA; Takezaki N; Nei M
    Mol Biol Evol; 1996 Mar; 13(3):525-36. PubMed ID: 8742641
    [TBL] [Abstract][Full Text] [Related]  

  • 23. A new efficient algorithm for inferring explicit hybridization networks following the Neighbor-Joining principle.
    Willems M; Tahiri N; Makarenkov V
    J Bioinform Comput Biol; 2014 Oct; 12(5):1450024. PubMed ID: 25219384
    [TBL] [Abstract][Full Text] [Related]  

  • 24. Algorithms for reticulate networks of multiple phylogenetic trees.
    Chen ZZ; Wang L
    IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(2):372-84. PubMed ID: 22025766
    [TBL] [Abstract][Full Text] [Related]  

  • 25. The behavior of admixed populations in neighbor-joining inference of population trees.
    Kopelman NM; Stone L; Gascuel O; Rosenberg NA
    Pac Symp Biocomput; 2013; ():273-84. PubMed ID: 23424132
    [TBL] [Abstract][Full Text] [Related]  

  • 26. BIONJ: an improved version of the NJ algorithm based on a simple model of sequence data.
    Gascuel O
    Mol Biol Evol; 1997 Jul; 14(7):685-95. PubMed ID: 9254330
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Family-Joining: A Fast Distance-Based Method for Constructing Generally Labeled Trees.
    Kalaghatgi P; Pfeifer N; Lengauer T
    Mol Biol Evol; 2016 Oct; 33(10):2720-34. PubMed ID: 27436007
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Generating normal networks via leaf insertion and nearest neighbor interchange.
    Zhang L
    BMC Bioinformatics; 2019 Dec; 20(Suppl 20):642. PubMed ID: 31842746
    [TBL] [Abstract][Full Text] [Related]  

  • 29. LifePrint: a novel k-tuple distance method for construction of phylogenetic trees.
    Reyes-Prieto F; García-Chéquer AJ; Jaimes-Díaz H; Casique-Almazán J; Espinosa-Lara JM; Palma-Orozco R; Méndez-Tenorio A; Maldonado-Rodríguez R; Beattie KL
    Adv Appl Bioinform Chem; 2011; 4():13-27. PubMed ID: 21918634
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Improvement of distance-based phylogenetic methods by a local maximum likelihood approach using triplets.
    Ranwez V; Gascuel O
    Mol Biol Evol; 2002 Nov; 19(11):1952-63. PubMed ID: 12411604
    [TBL] [Abstract][Full Text] [Related]  

  • 31. A stepwise algorithm for finding minimum evolution trees.
    Kumar S
    Mol Biol Evol; 1996 Apr; 13(4):584-93. PubMed ID: 8882501
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Clearcut: a fast implementation of relaxed neighbor joining.
    Sheneman L; Evans J; Foster JA
    Bioinformatics; 2006 Nov; 22(22):2823-4. PubMed ID: 16982706
    [TBL] [Abstract][Full Text] [Related]  

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

  • 34. BIMLR: a method for constructing rooted phylogenetic networks from rooted phylogenetic trees.
    Wang J; Guo M; Xing L; Che K; Liu X; Wang C
    Gene; 2013 Sep; 527(1):344-51. PubMed ID: 23816409
    [TBL] [Abstract][Full Text] [Related]  

  • 35. A simulation comparison of phylogeny algorithms under equal and unequal evolutionary rates.
    Kuhner MK; Felsenstein J
    Mol Biol Evol; 1994 May; 11(3):459-68. PubMed ID: 8015439
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Estimating species trees from unrooted gene trees.
    Liu L; Yu L
    Syst Biol; 2011 Oct; 60(5):661-7. PubMed ID: 21447481
    [TBL] [Abstract][Full Text] [Related]  

  • 37. TriLoNet: Piecing Together Small Networks to Reconstruct Reticulate Evolutionary Histories.
    Oldman J; Wu T; van Iersel L; Moulton V
    Mol Biol Evol; 2016 Aug; 33(8):2151-62. PubMed ID: 27189565
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Optimally Ordered Orthogonal Neighbor Joining Trees for Hierarchical Cluster Analysis.
    Ge T; Luo X; Wang Y; Sedlmair M; Cheng Z; Zhao Y; Liu X; Deussen O; Chen B
    IEEE Trans Vis Comput Graph; 2024 Aug; 30(8):5034-5046. PubMed ID: 37294655
    [TBL] [Abstract][Full Text] [Related]  

  • 39. NJML: a hybrid algorithm for the neighbor-joining and maximum-likelihood methods.
    Ota S; Li WH
    Mol Biol Evol; 2000 Sep; 17(9):1401-9. PubMed ID: 10958856
    [TBL] [Abstract][Full Text] [Related]  

  • 40. On the optimality of the neighbor-joining algorithm.
    Eickmeyer K; Huggins P; Pachter L; Yoshida R
    Algorithms Mol Biol; 2008 Apr; 3():5. PubMed ID: 18447942
    [TBL] [Abstract][Full Text] [Related]  

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