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 *

115 related articles for article (PubMed ID: 23837994)

  • 1. Extracting conflict-free information from multi-labeled trees.
    Deepak A; Fernández-Baca D; McMahon MM
    Algorithms Mol Biol; 2013 Jul; 8(1):18. PubMed ID: 23837994
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Polynomial-time algorithms for building a consensus MUL-tree.
    Cui Y; Jansson J; Sung WK
    J Comput Biol; 2012 Sep; 19(9):1073-88. PubMed ID: 22963134
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Do triplets have enough information to construct the multi-labeled phylogenetic tree?
    Hassanzadeh R; Eslahchi C; Sung WK
    PLoS One; 2014; 9(7):e103622. PubMed ID: 25080217
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Efficient Quartet Representations of Trees and Applications to Supertree and Summary Methods.
    Davidson R; Lawhorn M; Rusinko J; Weber N
    IEEE/ACM Trans Comput Biol Bioinform; 2018; 15(3):1010-1015. PubMed ID: 28113327
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Fast calculation of the quartet distance between trees of arbitrary degrees.
    Christiansen C; Mailund T; Pedersen CN; Randers M; Stissing MS
    Algorithms Mol Biol; 2006 Sep; 1():16. PubMed ID: 16999860
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Reconciling event-labeled gene trees with MUL-trees and species networks.
    Hellmuth M; Huber KT; Moulton V
    J Math Biol; 2019 Oct; 79(5):1885-1925. PubMed ID: 31410552
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Metrics on multilabeled trees: interrelationships and diameter bounds.
    Huber KT; Spillner A; Suchecki R; Moulton V
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(4):1029-40. PubMed ID: 21116046
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Quartets MaxCut: a divide and conquer quartets algorithm.
    Snir S; Rao S
    IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(4):704-18. PubMed ID: 21030737
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Encoding phylogenetic trees in terms of weighted quartets.
    Grünewald S; Huber KT; Moulton V; Semple C
    J Math Biol; 2008 Apr; 56(4):465-77. PubMed ID: 17891538
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Trees of trees: an approach to comparing multiple alternative phylogenies.
    Nye TM
    Syst Biol; 2008 Oct; 57(5):785-94. PubMed ID: 18853364
    [TBL] [Abstract][Full Text] [Related]  

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

  • 12. A sub-cubic time algorithm for computing the quartet distance between two general trees.
    Nielsen J; Kristensen AK; Mailund T; Pedersen CN
    Algorithms Mol Biol; 2011 Jun; 6():15. PubMed ID: 21639882
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Weighted quartets phylogenetics.
    Avni E; Cohen R; Snir S
    Syst Biol; 2015 Mar; 64(2):233-42. PubMed ID: 25414175
    [TBL] [Abstract][Full Text] [Related]  

  • 14. A strict upper bound for the partition distance and the cluster distance of phylogenetic trees for each fixed pair of topological trees.
    Middendorf M; Wieseke N
    PLoS One; 2018; 13(9):e0204907. PubMed ID: 30265723
    [TBL] [Abstract][Full Text] [Related]  

  • 15. On the unranked topology of maximally probable ranked gene tree topologies.
    Disanto F; Miglionico P; Narduzzi G
    J Math Biol; 2019 Sep; 79(4):1205-1225. PubMed ID: 31222377
    [TBL] [Abstract][Full Text] [Related]  

  • 16. An efficient algorithm for testing the compatibility of phylogenies with nested taxa.
    Deng Y; Fernández-Baca D
    Algorithms Mol Biol; 2017; 12():7. PubMed ID: 28331536
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Reconstructing tumor evolutionary histories and clone trees in polynomial-time with SubMARine.
    Sundermann LK; Wintersinger J; Rätsch G; Stoye J; Morris Q
    PLoS Comput Biol; 2021 Jan; 17(1):e1008400. PubMed ID: 33465079
    [TBL] [Abstract][Full Text] [Related]  

  • 18. An error-correcting map for quartets can improve the signals for phylogenetic trees.
    Willson SJ
    Mol Biol Evol; 2001 Mar; 18(3):344-51. PubMed ID: 11230535
    [TBL] [Abstract][Full Text] [Related]  

  • 19. On the quality of tree-based protein classification.
    Lazareva-Ulitsky B; Diemer K; Thomas PD
    Bioinformatics; 2005 May; 21(9):1876-90. PubMed ID: 15647305
    [TBL] [Abstract][Full Text] [Related]  

  • 20. The complexity of deriving multi-labeled trees from bipartitions.
    Huber KT; Lott M; Moulton V; Spillner A
    J Comput Biol; 2008; 15(6):639-51. PubMed ID: 18631026
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.