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.
122 related articles for article (PubMed ID: 24833220)
1. 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]
2. 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]
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. 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]
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. 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]
8. Linear-time algorithms for phylogenetic tree completion under Robinson-Foulds distance. Bansal MS Algorithms Mol Biol; 2020; 15():6. PubMed ID: 32313549 [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. Enumeration of Rooted Binary Unlabeled Galled Trees. Agranat-Tamir L; Mathur S; Rosenberg NA Bull Math Biol; 2024 Mar; 86(5):45. PubMed ID: 38519704 [TBL] [Abstract][Full Text] [Related]
11. Enumerating all maximal frequent subtrees in collections of phylogenetic trees. Deepak A; Fernández-Baca D Algorithms Mol Biol; 2014; 9():16. PubMed ID: 25061474 [TBL] [Abstract][Full Text] [Related]
12. On cherry and pitchfork distributions of random rooted and unrooted phylogenetic trees. Choi KP; Thompson A; Wu T Theor Popul Biol; 2020 Apr; 132():92-104. PubMed ID: 32135170 [TBL] [Abstract][Full Text] [Related]
13. Integer linear programming as a tool for constructing trees from quartet data. Weyer-Menkhoff J; Devauchelle C; Grossmann A; Grünewald S Comput Biol Chem; 2005 Jun; 29(3):196-203. PubMed ID: 15979039 [TBL] [Abstract][Full Text] [Related]
14. 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]
15. An optimal algorithm for computing all subtree repeats in trees. Flouri T; Kobert K; Pissis SP; Stamatakis A Philos Trans A Math Phys Eng Sci; 2014 May; 372(2016):20130140. PubMed ID: 24751873 [TBL] [Abstract][Full Text] [Related]
16. Using max cut to enhance rooted trees consistency. Snir S; Rao S IEEE/ACM Trans Comput Biol Bioinform; 2006; 3(4):323-33. PubMed ID: 17085842 [TBL] [Abstract][Full Text] [Related]