GGCAT is a tool for building compacted (and optionally colored) de Bruijn graphs from raw sequencing data or for merging multiple existing cDBG in a single graph. It also supports sequence queryies to either a colored or non-colored graph (i.e. number/percentage of present kmers).
To build a new graph with a specified k of some input files, run:
ggcat build -k <k_value> -j <threads_count> <input_files> -o <output_file>
Or if you have a file with a list of input files:
ggcat build -k <k_value> -j <threads_count> -l <input_files_list> -o <output_file>
To build a colored graph, add the -c flag to the above commands
To build links between maximal unitigs in BCALM2 like format, use the -e flag
Unitigs are a plain-text representation of the set of kmers in the input reads / genomes, but not of minimum size. GGCAT integrates the matchtigs & eulertigs libraries. These libraries assume a set of maximal unitigs as input, and compute such minimum representations, allowing or forbidding repetitions of kmers, respectively. To build greedy matchtigs, use the -g flag; to build eulertigs, use the --eulertigs flag; to build a greedy version of eulertigs, use the --pathtigs flag.
Here are all listed the available options for graph building:
> ggcat build --help
USAGE:
ggcat build [FLAGS] [OPTIONS] [--] [input]...
FLAGS:
-c, --colors Enable colors
--eulertigs Generate eulertigs instead of maximal unitigs
-f, --forward-only Treats reverse complementary kmers as different
-e, --generate-maximal-unitigs-links Generate maximal unitigs connections references, in BCALM2 format
L:<+/->:<other id>:<+/->
-g, --greedy-matchtigs Generate greedy matchtigs instead of maximal unitigs
-h, --help Prints help information
--keep-temp-files Keep intermediate temporary files for debugging purposes
--pathtigs Generate pathtigs instead of maximal unitigs
-p, --prefer-memory Use all the given memory before writing to disk
-V, --version Prints version information
OPTIONS:
-b, --buckets-count-log <buckets-count-log> The log2 of the number of buckets
-w, --hash-type <hash-type>
Hash type used to identify kmers [default: Auto]
-l, --input-lists <input-lists>... The lists of input files
--intermediate-compression-level <intermediate-compression-level>
The level of lz4 compression to be used for the intermediate files
-k <klen> Specifies the k-mers length [default: 32]
--last-step <last-step> [default: BuildUnitigs]
-m, --memory <memory> Maximum memory usage (GB) [default: 2]
-s, --min-multiplicity <min-multiplicity>
Minimum multiplicity required to keep a kmer [default: 2]
--mlen <mlen>
Overrides the default m-mers (minimizers) length
-o, --output-file <output-file> [default: output.fasta.lz4]
--step <step> [default: MinimizerBucketing]
-t, --temp-dir <temp-dir>
Directory for temporary files (default .temp_files) [default: .temp_files]
-j, --threads-count <threads-count> [default: 16]
ARGS:
<input>... The input files
To query an uncolored graph use the command:
ggcat query -k <k_value> -j <threads_count> <input-graph> <input-query>
The provided k value must match the one used for graph construction. To query a colored graph use the command:
ggcat query --colors -k <k_value> -j <threads_count> <input-graph> <input-query>
The tool automatically searches for the colormap file associated with the input graph, that must have the same name as the graph with extension '.colors.dat'
The colors in the output are by default represented by an integer, to recover a mapping between the integers
and the color filenames, use the command ggcat dump-colors <colormap> <output_file>.
If you instead want the color file names to be written directly in the query output (leading to a potentially much bigger output file),
pass the option -f JsonLinesWithNames.
Here are listed all the available options for graph querying:
> ggcat query --help
USAGE:
ggcat query [FLAGS] [OPTIONS] <input-graph> <input-query>
FLAGS:
-c, --colors Enable colors
-f, --forward-only Treats reverse complementary kmers as different
-h, --help Prints help information
--keep-temp-files Keep intermediate temporary files for debugging purposes
-p, --prefer-memory Use all the given memory before writing to disk
-V, --version Prints version information
OPTIONS:
-b, --buckets-count-log <buckets-count-log> The log2 of the number of buckets
-f, --colored-query-output-format <colored-query-output-format>
-w, --hash-type <hash-type>
Hash type used to identify kmers [default: Auto]
--intermediate-compression-level <intermediate-compression-level>
The level of lz4 compression to be used for the intermediate files
-k <klen> Specifies the k-mers length [default: 32]
-m, --memory <memory> Maximum memory usage (GB) [default: 2]
--mlen <mlen>
Overrides the default m-mers (minimizers) length
-o, --output-file-prefix <output-file-prefix> [default: output]
-x, --step <step> [default: MinimizerBucketing]
-t, --temp-dir <temp-dir>
Directory for temporary files (default .temp_files) [default: .temp_files]
-j, --threads-count <threads-count> [default: 16]
ARGS:
<input-graph> The input graph
<input-query> The input query as a .fasta file
At the moment building from source is the only option to install the tool. To build the tool the Rust nightly toolchain is required, and can be downloaded with the following commands:
curl --proto '=https' --tlsv1.2 -sSf https://sh.rustup.rs | sh
rustup toolchain install nightly
Follow the instructions at the site: https://rustup.rs/
The building process was not tested on windows, but it should work with minor tweaks.
Then the tool can be installed with the commands:
git clone https://github.com/algbio/ggcat --recursive
cd ggcat/
cargo install --path crates/cmdline/ --locked
the binary is automatically copied to $HOME/.cargo/bin
To launch the tool directly from the command line, the above directory should be added to the $PATH variable.
GGCAT has an experimental API for Rust and C++.
Add a dependency to the crates/api/ crate to use it in your project. Check crates/api/example for usage examples.
Run the makefile inside crates/capi/ggcat-cpp-api to build the library. Check crates/capi/ggcat-cpp-api/example for usage examples.
If you use GGCAT in your research, please cite the following article:
Extremely-fast construction and querying of compacted and colored de Bruijn graphs with GGCAT Andrea Cracco, Alexandru I. Tomescu Genome Research gr.277615.122; doi: https://doi.org/10.1101/gr.277615.122
If you use a matchtigs/eulertigs output, please also cite the following articles:
Matchtigs: minimum plain text representation of kmer sets Sebastian Schmidt, Shahbaz Khan, Jarno Alanko, Alexandru I. Tomescu bioRxiv 2021.12.15.472871; doi: https://doi.org/10.1101/2021.12.15.472871
Eulertigs: minimum plain text representation of k-mer sets without repetitions in linear time Sebastian Schmidt and Jarno N. Alanko WABI 2022. 10.4230/LIPIcs.WABI.2022.2.