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.
410 related articles for article (PubMed ID: 29900080)
1. BCD Beam Search: considering suboptimal partial solutions in Bad Clade Deletion supertrees. Fleischauer M; Böcker S PeerJ; 2018; 6():e4987. PubMed ID: 29900080 [TBL] [Abstract][Full Text] [Related]
2. Bad Clade Deletion Supertrees: A Fast and Accurate Supertree Algorithm. Fleischauer M; Böcker S Mol Biol Evol; 2017 Sep; 34(9):2408-2421. PubMed ID: 28873954 [TBL] [Abstract][Full Text] [Related]
3. Performance of flip supertree construction with a heuristic algorithm. Eulenstein O; Chen D; Burleigh JG; Fernández-Baca D; Sanderson MJ Syst Biol; 2004 Apr; 53(2):299-308. PubMed ID: 15205054 [TBL] [Abstract][Full Text] [Related]
8. Comparative performance of supertree algorithms in large data sets using the soapberry family (Sapindaceae) as a case study. Buerki S; Forest F; Salamin N; Alvarez N Syst Biol; 2011 Jan; 60(1):32-44. PubMed ID: 21068445 [TBL] [Abstract][Full Text] [Related]
12. A comparison of supermatrix and supertree methods for multilocus phylogenetics using organismal datasets. Janies DA; Studer J; Handelman SK; Linchangco G Cladistics; 2013 Oct; 29(5):560-566. PubMed ID: 34798766 [TBL] [Abstract][Full Text] [Related]
13. Novel versus unsupported clades: assessing the qualitative support for clades in MRP supertrees. Bininda-Emonds OR Syst Biol; 2003 Dec; 52(6):839-48. PubMed ID: 14668120 [TBL] [Abstract][Full Text] [Related]
14. A simulation study comparing supertree and combined analysis methods using SMIDGen. Swenson MS; Barbançon F; Warnow T; Linder CR Algorithms Mol Biol; 2010 Jan; 5():8. PubMed ID: 20047664 [TBL] [Abstract][Full Text] [Related]
15. Using Robinson-Foulds supertrees in divide-and-conquer phylogeny estimation. Yu X; Le T; Christensen SA; Molloy EK; Warnow T Algorithms Mol Biol; 2021 Jun; 16(1):12. PubMed ID: 34183037 [TBL] [Abstract][Full Text] [Related]
16. The shape of supertrees to come: tree shape related properties of fourteen supertree methods. Wilkinson M; Cotton JA; Creevey C; Eulenstein O; Harris SR; Lapointe FJ; Levasseur C; McInerney JO; Pisani D; Thorley JL Syst Biol; 2005 Jun; 54(3):419-31. PubMed ID: 16012108 [TBL] [Abstract][Full Text] [Related]
17. Implementing and testing Bayesian and maximum-likelihood supertree methods in phylogenetics. Akanni WA; Wilkinson M; Creevey CJ; Foster PG; Pisani D R Soc Open Sci; 2015 Aug; 2(8):140436. PubMed ID: 26361544 [TBL] [Abstract][Full Text] [Related]
18. Fast local search for unrooted Robinson-Foulds supertrees. Chaudhary R; Burleigh JG; Fernández-Baca D IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(4):1004-13. PubMed ID: 22431553 [TBL] [Abstract][Full Text] [Related]
19. SuperFine: fast and accurate supertree estimation. Swenson MS; Suri R; Linder CR; Warnow T Syst Biol; 2012 Mar; 61(2):214-27. PubMed ID: 21934137 [TBL] [Abstract][Full Text] [Related]
20. 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] [Next] [New Search]