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 *

163 related articles for article (PubMed ID: 24651968)

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

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

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

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

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

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

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

  • 10. TREE-PUZZLE: maximum likelihood phylogenetic analysis using quartets and parallel computing.
    Schmidt HA; Strimmer K; Vingron M; von Haeseler A
    Bioinformatics; 2002 Mar; 18(3):502-4. PubMed ID: 11934758
    [TBL] [Abstract][Full Text] [Related]  

  • 11. A fast tool for minimum hybridization networks.
    Chen ZZ; Wang L; Yamanaka S
    BMC Bioinformatics; 2012 Jul; 13():155. PubMed ID: 22748099
    [TBL] [Abstract][Full Text] [Related]  

  • 12. URec: a system for unrooted reconciliation.
    Górecki P; Tiuryn J
    Bioinformatics; 2007 Feb; 23(4):511-2. PubMed ID: 17182699
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Trees from trees: construction of phylogenetic supertrees using clann.
    Creevey CJ; McInerney JO
    Methods Mol Biol; 2009; 537():139-61. PubMed ID: 19378143
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Reconstructing a phylogenetic level-1 network from quartets.
    Keijsper JC; Pendavingh RA
    Bull Math Biol; 2014 Oct; 76(10):2517-41. PubMed ID: 25234337
    [TBL] [Abstract][Full Text] [Related]  

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

  • 16. DendroPy: a Python library for phylogenetic computing.
    Sukumaran J; Holder MT
    Bioinformatics; 2010 Jun; 26(12):1569-71. PubMed ID: 20421198
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Calculation, visualization, and manipulation of MASTs (Maximum Agreement Subtrees).
    Dong S; Kraemer E
    Proc IEEE Comput Syst Bioinform Conf; 2004; ():405-14. PubMed ID: 16448033
    [TBL] [Abstract][Full Text] [Related]  

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

  • 19. RBT--a tool for building refined Buneman trees.
    Besenbacher S; Mailund T; Westh-Nielsen L; Pedersen CN
    Bioinformatics; 2005 Apr; 21(8):1711-2. PubMed ID: 15585529
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Minimum triplet covers of binary phylogenetic X-trees.
    Huber KT; Moulton V; Steel M
    J Math Biol; 2017 Dec; 75(6-7):1827-1840. PubMed ID: 28608005
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 9.