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 *

116 related articles for article (PubMed ID: 29993953)

  • 1. Fast Algorithms for Computing Path-Difference Distances.
    Wang BF; Li CY
    IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(2):569-582. PubMed ID: 29993953
    [TBL] [Abstract][Full Text] [Related]  

  • 2. A fast algorithm for computing geodesic distances in tree space.
    Owen M; Provan JS
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(1):2-13. PubMed ID: 21071792
    [TBL] [Abstract][Full Text] [Related]  

  • 3. An efficient algorithm for approximating geodesic distances in tree space.
    Battagliero S; Puglia G; Vicario S; Rubino F; Scioscia G; Leo P
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(5):1196-207. PubMed ID: 21116041
    [TBL] [Abstract][Full Text] [Related]  

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

  • 5. A practical O(n log2 n) time algorithm for computing the triplet distance on binary trees.
    Sand A; Brodal GS; Fagerberg R; Pedersen CN; Mailund T
    BMC Bioinformatics; 2013; 14 Suppl 2(Suppl 2):S18. PubMed ID: 23368759
    [TBL] [Abstract][Full Text] [Related]  

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

  • 7. Comparison of tree-child phylogenetic networks.
    Cardona G; Rosselló F; Valiente G
    IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(4):552-69. PubMed ID: 19875855
    [TBL] [Abstract][Full Text] [Related]  

  • 8. The expected value of the squared cophenetic metric under the Yule and the uniform models.
    Cardona G; Mir A; Rosselló F; Rotger L
    Math Biosci; 2018 Jan; 295():73-85. PubMed ID: 29155134
    [TBL] [Abstract][Full Text] [Related]  

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

  • 10. Computing Manhattan Path-Difference Median Trees: A Practical Local Search Approach.
    Markin A; Eulenstein O
    IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(4):1063-1076. PubMed ID: 28650824
    [TBL] [Abstract][Full Text] [Related]  

  • 11. An exact algorithm for the geodesic distance between phylogenetic trees.
    Kupczok A; von Haeseler A; Klaere S
    J Comput Biol; 2008; 15(6):577-91. PubMed ID: 18631022
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 14. A metric for phylogenetic trees based on matching.
    Lin Y; Rajan V; Moret BM
    IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(4):1014-22. PubMed ID: 22184263
    [TBL] [Abstract][Full Text] [Related]  

  • 15. On the fixed parameter tractability of agreement-based phylogenetic distances.
    Bordewich M; Scornavacca C; Tokac N; Weller M
    J Math Biol; 2017 Jan; 74(1-2):239-257. PubMed ID: 27221239
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Cophenetic metrics for phylogenetic trees, after Sokal and Rohlf.
    Cardona G; Mir A; Rosselló F; Rotger L; Sánchez D
    BMC Bioinformatics; 2013 Jan; 14():3. PubMed ID: 23323711
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Distorted metrics on trees and phylogenetic forests.
    Mossel E
    IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(1):108-16. PubMed ID: 17277418
    [TBL] [Abstract][Full Text] [Related]  

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

  • 19. Metrics for phylogenetic networks I: generalizations of the Robinson-Foulds metric.
    Cardona G; Llabrés M; Rosselló F; Valiente G
    IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(1):46-61. PubMed ID: 19179698
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Distance-Based Phylogenetic Methods Around a Polytomy.
    Davidson R; Sullivant S
    IEEE/ACM Trans Comput Biol Bioinform; 2014; 11(2):325-35. PubMed ID: 26355780
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.