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.
42. Seq-Gen: an application for the Monte Carlo simulation of DNA sequence evolution along phylogenetic trees. Rambaut A; Grassly NC Comput Appl Biosci; 1997 Jun; 13(3):235-8. PubMed ID: 9183526 [TBL] [Abstract][Full Text] [Related]
43. Optimal gene trees from sequences and species trees using a soft interpretation of parsimony. Berglund-Sonnhammer AC; Steffansson P; Betts MJ; Liberles DA J Mol Evol; 2006 Aug; 63(2):240-50. PubMed ID: 16830091 [TBL] [Abstract][Full Text] [Related]
44. SUNPLIN: simulation with uncertainty for phylogenetic investigations. Martins WS; Carmo WC; Longo HJ; Rosa TC; Rangel TF BMC Bioinformatics; 2013 Nov; 14():324. PubMed ID: 24229408 [TBL] [Abstract][Full Text] [Related]
45. Phylogenetic networks do not need to be complex: using fewer reticulations to represent conflicting clusters. van Iersel L; Kelk S; Rupp R; Huson D Bioinformatics; 2010 Jun; 26(12):i124-31. PubMed ID: 20529896 [TBL] [Abstract][Full Text] [Related]
46. [A fast algorithm to build a supertree with a set of gene trees]. Gorbunov KIu; Liubetskiĭ VA Mol Biol (Mosk); 2012; 46(1):176-83. PubMed ID: 22642116 [TBL] [Abstract][Full Text] [Related]
47. CAFE: a computational tool for the study of gene family evolution. De Bie T; Cristianini N; Demuth JP; Hahn MW Bioinformatics; 2006 May; 22(10):1269-71. PubMed ID: 16543274 [TBL] [Abstract][Full Text] [Related]
48. Calculation, visualization, and manipulation of MASTs (Maximum Agreement Subtrees). Dong S; Kraemer E Proc IEEE Comput Syst Bioinform Conf; 2004; ():405-14. PubMed ID: 16448033 [TBL] [Abstract][Full Text] [Related]
49. BAli-Phy version 3: model-based co-estimation of alignment and phylogeny. Redelings BD Bioinformatics; 2021 Sep; 37(18):3032-3034. PubMed ID: 33677478 [TBL] [Abstract][Full Text] [Related]
50. Treerecs: an integrated phylogenetic tool, from sequences to reconciliations. Comte N; Morel B; Hasić D; Guéguen L; Boussau B; Daubin V; Penel S; Scornavacca C; Gouy M; Stamatakis A; Tannier E; Parsons DP Bioinformatics; 2020 Sep; 36(18):4822-4824. PubMed ID: 33085745 [TBL] [Abstract][Full Text] [Related]
51. Clearcut: a fast implementation of relaxed neighbor joining. Sheneman L; Evans J; Foster JA Bioinformatics; 2006 Nov; 22(22):2823-4. PubMed ID: 16982706 [TBL] [Abstract][Full Text] [Related]
52. AUGIST: inferring species trees while accommodating gene tree uncertainty. Oliver JC Bioinformatics; 2008 Dec; 24(24):2932-3. PubMed ID: 18953045 [TBL] [Abstract][Full Text] [Related]
53. On the Complexity of Duplication-Transfer-Loss Reconciliation with Non-Binary Gene Trees. Kordi M; Bansal MS IEEE/ACM Trans Comput Biol Bioinform; 2017; 14(3):587-599. PubMed ID: 28055898 [TBL] [Abstract][Full Text] [Related]
54. Multiple consensus trees: a method to separate divergent genes. Guénoche A BMC Bioinformatics; 2013 Feb; 14():46. PubMed ID: 23394478 [TBL] [Abstract][Full Text] [Related]
55. On the quality of tree-based protein classification. Lazareva-Ulitsky B; Diemer K; Thomas PD Bioinformatics; 2005 May; 21(9):1876-90. PubMed ID: 15647305 [TBL] [Abstract][Full Text] [Related]
56. 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]
57. Methods for automatic reference trees and multilevel phylogenetic placement. Czech L; Barbera P; Stamatakis A Bioinformatics; 2019 Apr; 35(7):1151-1158. PubMed ID: 30169747 [TBL] [Abstract][Full Text] [Related]