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 *

158 related articles for article (PubMed ID: 17277418)

  • 21. When is a Phylogenetic Network Simply an Amalgamation of Two Trees?
    Semple C; Simpson J
    Bull Math Biol; 2018 Sep; 80(9):2338-2348. PubMed ID: 29981001
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Measuring inconsistency in phylogenetic trees.
    Willson SJ
    J Theor Biol; 1998 Jan; 190(1):15-36. PubMed ID: 9473388
    [TBL] [Abstract][Full Text] [Related]  

  • 23. Computing nearest neighbour interchange distances between ranked phylogenetic trees.
    Collienne L; Gavryushkin A
    J Math Biol; 2021 Jan; 82(1-2):8. PubMed ID: 33492606
    [TBL] [Abstract][Full Text] [Related]  

  • 24. Co-divergence and tree topology.
    Calamoneri T; Monti A; Sinaimeri B
    J Math Biol; 2019 Aug; 79(3):1149-1167. PubMed ID: 31203388
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Species Tree Inference Using a Mixture Model.
    Ullah I; Parviainen P; Lagergren J
    Mol Biol Evol; 2015 Sep; 32(9):2469-82. PubMed ID: 25963975
    [TBL] [Abstract][Full Text] [Related]  

  • 26. Fast computation of distance estimators.
    Elias I; Lagergren J
    BMC Bioinformatics; 2007 Mar; 8():89. PubMed ID: 17355623
    [TBL] [Abstract][Full Text] [Related]  

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

  • 28. Algorithms for efficient near-perfect phylogenetic tree reconstruction in theory and practice.
    Sridhar S; Dhamdhere K; Blelloch G; Halperin E; Ravi R; Schwartz R
    IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(4):561-71. PubMed ID: 17975268
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Bounds for phylogenetic network space metrics.
    Francis A; Huber KT; Moulton V; Wu T
    J Math Biol; 2018 Apr; 76(5):1229-1248. PubMed ID: 28836230
    [TBL] [Abstract][Full Text] [Related]  

  • 30. An Efficient Algorithm for the Rooted Triplet Distance Between Galled Trees.
    Jansson J; Rajaby R; Sung WK
    J Comput Biol; 2019 Sep; 26(9):893-907. PubMed ID: 30990336
    [No Abstract]   [Full Text] [Related]  

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

  • 32. A partial order and cluster-similarity metric on rooted phylogenetic trees.
    Hendriksen M; Francis A
    J Math Biol; 2020 Apr; 80(5):1265-1290. PubMed ID: 32067071
    [TBL] [Abstract][Full Text] [Related]  

  • 33. On the neighborhoods of trees.
    Humphries PJ; Wu T
    IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(3):721-8. PubMed ID: 24091404
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Bayesian coestimation of phylogeny and sequence alignment.
    Lunter G; Miklós I; Drummond A; Jensen JL; Hein J
    BMC Bioinformatics; 2005 Apr; 6():83. PubMed ID: 15804354
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Combinatorial Scoring of Phylogenetic Trees and Networks Based on Homoplasy-Free Characters.
    Alexeev N; Alekseyev MA
    J Comput Biol; 2018 Nov; 25(11):1203-1219. PubMed ID: 30133318
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Phylogenetic Flexibility via Hall-Type Inequalities and Submodularity.
    Huber KT; Moulton V; Steel M
    Bull Math Biol; 2019 Feb; 81(2):598-617. PubMed ID: 29589255
    [TBL] [Abstract][Full Text] [Related]  

  • 37. A practical algorithm for reconstructing level-1 phylogenetic networks.
    Huber KT; van Iersel L; Kelk S; Suchecki R
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(3):635-49. PubMed ID: 21393651
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Hamiltonian walks of phylogenetic treespaces.
    Gordon K; Ford E; St John K
    IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(4):1076-9. PubMed ID: 24334399
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Fixed-parameter tractability of the maximum agreement supertree problem.
    Guillemot S; Berry V
    IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(2):342-53. PubMed ID: 20431153
    [TBL] [Abstract][Full Text] [Related]  

  • 40. On Tree-Based Phylogenetic Networks.
    Zhang L
    J Comput Biol; 2016 Jul; 23(7):553-65. PubMed ID: 27228397
    [TBL] [Abstract][Full Text] [Related]  

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