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.
106 related articles for article (PubMed ID: 21639882)
1. 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]
2. 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]
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. 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]
5. 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]
12. 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]
13. 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]
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. Towards sub-quadratic time and space complexity solutions for the dated tree reconciliation problem. Drinkwater B; Charleston MA Algorithms Mol Biol; 2016; 11():15. PubMed ID: 27213010 [TBL] [Abstract][Full Text] [Related]
16. 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]
17. 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. Computing the distribution of the Robinson-Foulds distance. Hayati M; Chindelevitch L Comput Biol Chem; 2020 May; 87():107284. PubMed ID: 32599459 [TBL] [Abstract][Full Text] [Related]
20. 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] [Next] [New Search]