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 *

136 related articles for article (PubMed ID: 16999860)

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

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

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

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

  • 5. QDist--quartet distance between evolutionary trees.
    Mailund T; Pedersen CN
    Bioinformatics; 2004 Jul; 20(10):1636-7. PubMed ID: 14962942
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 8. Computing the all-pairs quartet distance on a set of evolutionary trees.
    Stissing M; Mailund T; Pedersen CN; Brodal GS; Fagerberg R
    J Bioinform Comput Biol; 2008 Feb; 6(1):37-50. PubMed ID: 18324744
    [TBL] [Abstract][Full Text] [Related]  

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

  • 10. Algorithms for computing the triplet and quartet distances for binary and general trees.
    Sand A; Holt MK; Johansen J; Fagerberg R; Brodal GS; Pedersen CN; Mailund T
    Biology (Basel); 2013 Sep; 2(4):1189-209. PubMed ID: 24833220
    [TBL] [Abstract][Full Text] [Related]  

  • 11. On the nearest neighbour interchange distance between evolutionary trees.
    Li M; Tromp J; Zhang L
    J Theor Biol; 1996 Oct; 182(4):463-7. PubMed ID: 8944893
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Anchoring quartet-based phylogenetic distances and applications to species tree reconstruction.
    Sayyari E; Mirarab S
    BMC Genomics; 2016 Nov; 17(Suppl 10):783. PubMed ID: 28185574
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Optimal algorithms for local vertex quartet cleaning.
    Della Vedova G; Wareham HT
    Bioinformatics; 2002 Oct; 18(10):1297-304. PubMed ID: 12376373
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Quartet MaxCut: a fast algorithm for amalgamating quartet trees.
    Snir S; Rao S
    Mol Phylogenet Evol; 2012 Jan; 62(1):1-8. PubMed ID: 21762785
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Constructing phylogenies from quartets: elucidation of eutherian superordinal relationships.
    Ben-Dor A; Chor B; Graur D; Ophir R; Pelleg D
    J Comput Biol; 1998; 5(3):377-90. PubMed ID: 9773339
    [TBL] [Abstract][Full Text] [Related]  

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

  • 17. ASTRAL-III: polynomial time species tree reconstruction from partially resolved gene trees.
    Zhang C; Rabiee M; Sayyari E; Mirarab S
    BMC Bioinformatics; 2018 May; 19(Suppl 6):153. PubMed ID: 29745866
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

    [Next]    [New Search]
    of 7.