Please see our website for more information on Gubbins or read our paper:
Croucher N. J., Page A. J., Connor T. R., Delaney A. J., Keane J. A., Bentley S. D., Parkhill J., Harris S.R. "Rapid phylogenetic analysis of large samples of recombinant bacterial whole genome sequences using Gubbins". doi:10.1093/nar/gku1196, Nucleic Acids Research, 2014.
Since the introduction of high-throughput, second-generation DNA sequencing technologies, there has been an enormous increase in the size of datasets being used for estimating bacterial population phylodynamics. Although many phylogenetic techniques are scalable to hundreds of bacterial genomes, methods which have been used for mitigating the effect of mechanisms of horizontal sequence transfer on phylogenetic reconstructions cannot cope with these new datasets. Gubbins (Genealogies Unbiased By recomBinations In Nucleotide Sequences) is an algorithm that iteratively identifies loci containing elevated densities of base substitutions while concurrently constructing a phylogeny based on the putative point mutations outside of these regions. Simulations demonstrate the algorithm generates highly accurate reconstructions under realistic models of short-term bacterial evolution, and can be run in only a few hours on alignments of hundreds of bacterial genome sequences.
Please see the INSTALL file for detailed instructions.
To run Gubbins with default settings:
run_gubbins.py [FASTA alignment]
The name of a sequence in the alignment on which to root the tree
A Newick-format starting tree on which to perform the first iteration analysis. The default is to compute a starting tree using RAxML
Filter out taxa with more than this percentage of missing data. Default is 25%
The algorithm to use in the construction of phylogenies in the analysis; can be ‘raxml’, to use RAxML, ‘fasttree’, to use Fasttree, or ‘hybrid’, to use Fasttree for the first iteration and RAxML in all subsequent iterations. Default is raxml
The maximum number of iterations to perform; the algorithm will stop earlier than this if it converges on the same tree in two successive iterations. Default is 5.
The minimum number of base substitutions required to identify a recombination. Default is 3.
Criteria to use to know when to halt iterations [weighted_robinson_foulds|robinson_foulds|recombination]. Default is weighted_robinson_foulds.
Include a time stamp in the name of output files to avoid overwriting previous runs on the same input file. Default is to not include a time stamp.
Specifiy a prefix for output files. If none is provided it defaults to the name of the input FASTA alignment
Print debugging messages. Default is off.
Do not remove files from intermediate iterations. This option will also keep other files created by RAxML and fasttree, which would otherwise be deleted. Default is to only keep files from the final iteration.
If a prefix is not defined with the –prefix option, the default prefix of the output files is: X.Y
where: X = Prefix taken from the input fasta file Y = Time stamp. NOTE: This will only be included in the output file prefix if the –u flag has been selected
Output file suffices:
Recombination predictions in EMBL tab file format.
Recombination predictions in GFF3 format
Base substitution reconstruction in EMBL tab format.
VCF file summarising the distribution of SNPs
Per branch reporting of the base substitutions inside and outside recombinations events.
FASTA format alignment of filtered polymorphic sites used to generate the phylogeny in the final iteration.
Phylip format alignment of filtered polymorphic sites used to generate the phylogeny in the final iteration.
Final phylogenetic tree in newick format.
Data from the paper
From version 1.3.5 (25/6/15) to version 1.4.6 (29/2/16) trees were not midpoint rerooted by default. This doesnt have any effect on the recombination detection, but the output trees may not look as expected. Users are advised to upgrade to the latest version.