BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

164 related articles for article (PubMed ID: 27983874)

  • 1. A More Practical Algorithm for the Rooted Triplet Distance.
    Jansson J; Rajaby R
    J Comput Biol; 2017 Feb; 24(2):106-126. PubMed ID: 27983874
    [TBL] [Abstract][Full Text] [Related]  

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

  • 3. tqDist: a library for computing the quartet and triplet distances between binary or general trees.
    Sand A; Holt MK; Johansen J; Brodal GS; Mailund T; Pedersen CN
    Bioinformatics; 2014 Jul; 30(14):2079-80. PubMed ID: 24651968
    [TBL] [Abstract][Full Text] [Related]  

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

  • 5. Distribution and asymptotic behavior of the phylogenetic transfer distance.
    Dávila Felipe M; Domelevo Entfellner JB; Lemoine F; Truszkowski J; Gascuel O
    J Math Biol; 2019 Jul; 79(2):485-508. PubMed ID: 31037350
    [TBL] [Abstract][Full Text] [Related]  

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

  • 7. Determining the Consistency of Resolved Triplets and Fan Triplets.
    Jansson J; Lingas A; Rajaby R; Sung WK
    J Comput Biol; 2018 Jul; 25(7):740-754. PubMed ID: 29451395
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 10. Trinets encode orchard phylogenetic networks.
    Semple C; Toft G
    J Math Biol; 2021 Aug; 83(3):28. PubMed ID: 34420100
    [TBL] [Abstract][Full Text] [Related]  

  • 11. On Sackin's original proposal: the variance of the leaves' depths as a phylogenetic balance index.
    M Coronado T; Mir A; Rosselló F; Rotger L
    BMC Bioinformatics; 2020 Apr; 21(1):154. PubMed ID: 32326884
    [TBL] [Abstract][Full Text] [Related]  

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

  • 13. Two metrics on rooted unordered trees with labels.
    Wang Y
    Algorithms Mol Biol; 2022 Jun; 17(1):13. PubMed ID: 35668521
    [TBL] [Abstract][Full Text] [Related]  

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

  • 15. Trying out a million genes to find the perfect pair with RTIST.
    Zhelezov G; Degnan JH
    Bioinformatics; 2022 Jul; 38(14):3565-3573. PubMed ID: 35641003
    [TBL] [Abstract][Full Text] [Related]  

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

  • 17. The combinatorics of discrete time-trees: theory and open problems.
    Gavryushkin A; Whidden C; Matsen FA
    J Math Biol; 2018 Apr; 76(5):1101-1121. PubMed ID: 28756523
    [TBL] [Abstract][Full Text] [Related]  

  • 18. New algorithms for structure informed genome rearrangement.
    Ozeri E; Zehavi M; Ziv-Ukelson M
    Algorithms Mol Biol; 2023 Dec; 18(1):17. PubMed ID: 38037088
    [TBL] [Abstract][Full Text] [Related]  

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

  • 20. On Hill et al's conjecture for calculating the subtree prune and regraft distance between phylogenies.
    Linz S
    BMC Evol Biol; 2010 Oct; 10():334. PubMed ID: 21034464
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 9.