RUN_GUBBINS(1)
okay bestie, pull up a chair π«Ά this is the manual page for run_gubbins, a User Commands situation, and it is so much cooler than it sounds. it builds phylogenies. for bacteria. while dealing with recombination. no cap. π
β¨ NAME β¨
run_gubbins β phylogenetic analysis of genome sequences π that's it, that's the whole name section, she's concise and she knows it π
π¦ SYNOPSIS π¦
run_gubbins [-h] [--outgroup OUTGROUP] [--starting_tree STARTING_TREE]
[--use_time_stamp] [--verbose] [--no_cleanup] [--tree_builder
TREE_BUILDER] [--iterations ITERATIONS] [--min_snps MIN_SNPS]
[--filter_percentage FILTER_PERCENTAGE] [--prefix PREFIX] [--threads
THREADS] [--converge_method CONVERGE_METHOD] [--version]
[--min_window_size MIN_WINDOW_SIZE] [--max_window_size MAX_WINDOW_SIZE]
alignment_filename
yes she has a LOT of flags. she's a maximalist. we respect it. β¨
πΈ DESCRIPTION πΈ
okay so. Gubbins supports rapid phylogenetic analysis of large samples of recombinant bacterial whole genome sequences. literally the whole point. π¦ β¨
and in case you were wondering what the name even means (I know you were, bestie, I know you): Gubbins stands for Genealogies Unbiased By recomBinations In Nucleotide Sequences π it's 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. the way that she does both at the same time?? multitasking queen fr fr π
and the simulations?? they demonstrate the algorithm generates highly accurate reconstructions under realistic models of short-term bacterial evolution β and she can run in only a few hours on alignments of hundreds of bacterial genome sequences. not slow. not messy. iconic behaviour only. π₯
π OPTIONS π
π positional arguments:
alignment_filenameβ the Multifasta alignment file. that's your input bestie, hand it over π«΄
β optional arguments:
-h,--helpβ shows this help message and dips out. classic. exit stage left π--outgroup OUTGROUP,-o OUTGROUPβ the Outgroup name for rerooting. and here's the cute part: a list of comma separated names can be used if they form a clade π§ so like, one name, or a whole little clade squad, your call.--starting_tree STARTING_TREE,-s STARTING_TREEβ Starting tree. give her a head start π±--use_time_stamp,-uβ Use a time stamp in file names. so you can tell your runs apart, unlike your exes β°--verbose,-vβ Turn on debugging. she gets chatty. we love a talkative queen π£οΈ--no_cleanup,-nβ Don't cleanup intermediate files. hoarder mode activated, the intermediate files stay ποΈ--tree_builder TREE_BUILDER,-t TREE_BUILDERβ Application to use for tree building [raxml|fasttree|hybrid], default RAxML. pick your fighter π₯--iterations ITERATIONS,-i ITERATIONSβ Maximum No. of iterations, default is5. she loops, she refines, she slays π--min_snps MIN_SNPS,-m MIN_SNPSβ Min SNPs to identify a recombination block, default is3π§¬--filter_percentage FILTER_PERCENTAGE,-f FILTER_PERCENTAGEβ Filter out taxa with more than this percentage of gaps, default is25. bye to the gappy ones, no offence πͺ--prefix PREFIX,-p PREFIXβ Add a prefix to the final output filenames. branding, babes π--threads THREADS,-c THREADSβ Number of threads to run with RAxML, but only if a PTHREADS version is available. read that twice bestie π
fr fr, that --threads caveat is real: it only does anything if you've got a PTHREADS build. no PTHREADS, no threading, don't come for me.
--converge_method CONVERGE_METHOD,-z CONVERGE_METHODβ Criteria to use to know when to halt iterations [weighted_robinson_foulds|robinson_foulds|recombination]. how does she know when to stop? one of these three tells her π--versionβ show program's version number and exit. the classic flex πββοΈ--min_window_size MIN_WINDOW_SIZE,-a MIN_WINDOW_SIZEβ Minimum window size, default100πͺ--max_window_size MAX_WINDOW_SIZE,-b MAX_WINDOW_SIZEβ Maximum window size, default10000πͺβ¨
π SEE ALSO π
the receipts, bestie β she is peer reviewed and everything π§Ύ:
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". Nucleic Acids Res. 2015 Feb 18;43(3):e15. doi: 10.1093/nar/gku1196.
like, doi: 10.1093/nar/gku1196, she's in the literature, she's cited, she's that girl ππ
π«Ά AUTHOR π«Ά
This manpage was written by Andreas Tille for the Debian distribution and can be used for any other usage of the program. thank you Andreas, we appreciate you π₯ΉπΈ
and that's the whole vibe check, bestie π this was run_gubbins version 2.0.0, dated Julu 2016 (yes, Julu, I'm just the messenger π«£), filed under RUN_GUBBINS(1). go build a tree, you've got this. periodt. πβ¨
π¦ where this page comes from
- debian bookworm: gubbins 2.4.1-5 Β· GPL-2.0-or-later
- debian trixie: gubbins 3.4-2 Β· GPL-2.0-or-later
- ubuntu jammy: gubbins 2.4.1-5 Β· GPL-2.0-or-later
- ubuntu noble: gubbins 3.3.3-1 Β· GPL-2.0-or-later
- ubuntu questing: gubbins 3.4-2
- ubuntu resolute: gubbins 3.4.3-2 Β· GPL-2.0-or-later
- ubuntu stonking: gubbins 3.4.3-4 Β· GPL-2.0-or-later
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash on : a language model's rewrite of the original, under its terms