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.
137 related articles for article (PubMed ID: 16999860)
21. The Performance of Two Supertree Schemes Compared Using Synthetic and Real Data Quartet Input. Avni E; Yona Z; Cohen R; Snir S J Mol Evol; 2018 Feb; 86(2):150-165. PubMed ID: 29460038 [TBL] [Abstract][Full Text] [Related]
22. 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]
23. Fast recovery of evolutionary trees with thousands of nodes. Csurös M J Comput Biol; 2002; 9(2):277-97. PubMed ID: 12015882 [TBL] [Abstract][Full Text] [Related]
24. Reconstructing phylogenies from noisy quartets in polynomial time with a high success probability. Wu G; Kao MY; Lin G; You JH Algorithms Mol Biol; 2008 Jan; 3():1. PubMed ID: 18218120 [TBL] [Abstract][Full Text] [Related]
25. Designing an A* algorithm for calculating edit distance between rooted-unordered trees. Horesh Y; Mehr R; Unger R J Comput Biol; 2006; 13(6):1165-76. PubMed ID: 16901235 [TBL] [Abstract][Full Text] [Related]
28. QNet: an agglomerative method for the construction of phylogenetic networks from weighted quartets. Grünewald S; Forslund K; Dress A; Moulton V Mol Biol Evol; 2007 Feb; 24(2):532-8. PubMed ID: 17119010 [TBL] [Abstract][Full Text] [Related]
29. Median quartet tree search algorithms using optimal subtree prune and regraft. Arasti S; Mirarab S Algorithms Mol Biol; 2024 Mar; 19(1):12. PubMed ID: 38481327 [TBL] [Abstract][Full Text] [Related]
30. 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]
33. An optimal algorithm to reconstruct trees from additive distance data. Hein JJ Bull Math Biol; 1989; 51(5):597-603. PubMed ID: 2804467 [TBL] [Abstract][Full Text] [Related]
34. Autumn Algorithm-Computation of Hybridization Networks for Realistic Phylogenetic Trees. Huson DH; Linz S IEEE/ACM Trans Comput Biol Bioinform; 2018; 15(2):398-410. PubMed ID: 26955052 [TBL] [Abstract][Full Text] [Related]
35. 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]
36. Polynomial algorithms for the Maximal Pairing Problem: efficient phylogenetic targeting on arbitrary trees. Arnold C; Stadler PF Algorithms Mol Biol; 2010 Jun; 5():25. PubMed ID: 20525185 [TBL] [Abstract][Full Text] [Related]
37. Computing all hybridization networks for multiple binary phylogenetic input trees. Albrecht B BMC Bioinformatics; 2015 Jul; 16():236. PubMed ID: 26223230 [TBL] [Abstract][Full Text] [Related]
38. The sum of root-leaf distance interdiction problem by upgrading edges/nodes on trees. Zhang Q; Guan X; Jia J; Qian X J Comb Optim; 2022; 44(1):74-93. PubMed ID: 34658658 [TBL] [Abstract][Full Text] [Related]
39. Computing a Consensus Phylogeny via Leaf Removal. Chen ZZ; Ueta S; Li J; Wang L J Comput Biol; 2020 Feb; 27(2):175-188. PubMed ID: 31638413 [No Abstract] [Full Text] [Related]
40. Genome-Wide Comparative Analysis of Phylogenetic Trees: The Prokaryotic Forest of Life. Puigbò P; Wolf YI; Koonin EV Methods Mol Biol; 2019; 1910():241-269. PubMed ID: 31278667 [TBL] [Abstract][Full Text] [Related] [Previous] [Next] [New Search]