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.
6. Problems with supertrees based on the subtree prune-and-regraft distance, with comments on majority rule supertrees. Goloboff PA; Szumik CA Cladistics; 2016 Feb; 32(1):82-89. PubMed ID: 34732022 [TBL] [Abstract][Full Text] [Related]
7. Invariant transformers of Robinson and Foulds distance matrices for Convolutional Neural Network. Tahiri N; Veriga A; Koshkarov A; Morozov B J Bioinform Comput Biol; 2022 Aug; 20(4):2250012. PubMed ID: 35798684 [TBL] [Abstract][Full Text] [Related]
9. PhySIC_IST: cleaning source trees to infer more informative supertrees. Scornavacca C; Berry V; Lefort V; Douzery EJ; Ranwez V BMC Bioinformatics; 2008 Oct; 9():413. PubMed ID: 18834542 [TBL] [Abstract][Full Text] [Related]
10. Semi-strict supertrees. Goloboff PA; Pol D Cladistics; 2002 Oct; 18(5):514-525. PubMed ID: 34911213 [TBL] [Abstract][Full Text] [Related]
11. 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]
12. 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]
13. Efficient algorithms for knowledge-enhanced supertree and supermatrix phylogenetic problems. Wehe A; Burleigh JG; Eulenstein O IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(6):1432-41. PubMed ID: 24407302 [TBL] [Abstract][Full Text] [Related]
14. 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]
16. L.U.St: a tool for approximated maximum likelihood supertree reconstruction. Akanni WA; Creevey CJ; Wilkinson M; Pisani D BMC Bioinformatics; 2014 Jun; 15():183. PubMed ID: 24925766 [TBL] [Abstract][Full Text] [Related]
17. COSPEDTree: COuplet Supertree by Equivalence Partitioning of Taxa Set and DAG Formation. Bhattacharyya S; Mukherjee J IEEE/ACM Trans Comput Biol Bioinform; 2015; 12(3):590-603. PubMed ID: 26357270 [TBL] [Abstract][Full Text] [Related]
18. 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]
19. Supertree construction in the genomic age. Bininda-Emonds OR Methods Enzymol; 2005; 395():745-57. PubMed ID: 15865993 [TBL] [Abstract][Full Text] [Related]
20. Reconstructing a SuperGeneTree minimizing reconciliation. Lafond M; Ouangraoua A; El-Mabrouk N BMC Bioinformatics; 2015; 16 Suppl 14(Suppl 14):S4. PubMed ID: 26451911 [TBL] [Abstract][Full Text] [Related] [Next] [New Search]