Visualization of different minimizer schemes supported in Digest and code example using library
- a
C++
library that supports various sub-sampling schemes for$k$ -mers in DNA sequences.-
Digest
library utilizes the rolling hash-function from ntHash to order the$k$ -mers in a window.
-
- a set of Python bindings that allow the user to run functions from the C++ library in Python.
After cloning from GitHub, we use the Meson build-system to install the library.
PREFIX
is an absolute path to library files will be install (*.h
and*.a
files)- IMPORTANT:
PREFIX
should not be the root directory of thedigest/
repo to avoid any issues with installation. - We suggest using
--prefix=$(pwd)/build
from within the root directory of thedigest/
repo.
- IMPORTANT:
- These commands generate an
include
andlib
folders inPREFIX
folder
git clone https://github.com/VeryAmazed/digest.git
meson setup --prefix=<PREFIX> --buildtype=release build
meson install -C build
If your coding project uses Meson
to build the executable(s), you can include a file called subprojects/digest.wrap
in your repository and let Meson install it for you.
To use Digest in your C++ project, you just need to include the header files (*.h
) and library file (*.a
) that were installed in the first step. Assuming that build/
is the directory you installed them in, here is how you can compile.
g++ -std=c++17 -o main main.cpp -I build/include/ -L build/lib -lnthash
There are three types of minimizer schemes that can be used:
- Windowed Minimizer: classifies a kmer as a minimizer if it is the smallest in the user specifed large window, using rightmost kmer to break ties.
- Modimizer: classifies a kmer as a minimizer if the hash of the kmer is congruent to the user specified value in the user specified mod-space.
- Syncmer: classifies a large window as a minimizer if its smallest value is equal to the value of the hashes of the leftmost or rightmost kmer in the window (doesn't care if the smallest hash value is not unique). Note that because of how the large window is defined if you are using the SKIPOVER policy and your sequence has non-ACTG characters, it is possible for this large window to have varying lengths in terms of number of characters.
The general steps to use Digest is as follows: (1) include the relevant header files, (2) declare the Digest object and (3) find the positions where the minimizers are present in the sequence.
#include "digest/digester.hpp"
#include "digest/window_minimizer.hpp"
digest::WindowMin<digest::BadCharPolicy::WRITEOVER, digest::ds::Adaptive> digester (dna, 15, 7);
std::vector<size_t> output;
digester.roll_minimizer(100, output);
- This code snippet will find up to 100 Windowed Minimizers and store their positions in the vector called
output
. -
digest::BadCharPolicy::WRITEOVER
means that anytime the code encounters an non-ACTG
character, it will replace it with anA
.-
digest::BadCharPolicy::SKIPOVER
will skip any$k$ -mers with non-ACTG
characters
-
-
digest::ds::Adaptive
is our recommended data-structure for finding the minimum value in a window (see wiki for other options)
If you would like to obtain both the positions and hash values for each minimizer, you can pass a vector of paired integers to do so.
std::vector<std::pair<size_t, size_t>> output;
digester.roll_minimizer(100, output);
Documentation generated with Doxygen can be found here
Included in the library are function bindings for each sub-sampling scheme for use in Python. To install the Python module, first install the library with meson
(see above for detailed instructions), and install with pip
. For this setup, the meson
prefix must be set to --prefix=/$DIGEST_REPO/build
:
meson setup --prefix=$(pwd)/build --buildtype=release build
meson install -C build
pip install .
Alternatively, copy the lib
and include
directories from the earlier meson installation to a directory in the repo called build
, and run pip install .
We recommend using a conda or python virtual environment. Once installed, you can import and use the Digest library in Python:
>>> from Digest import window_minimizer, syncmer, modimizer
>>> window_minimizer('ACGTACGTAGCTAGCTAGCTAGCTGATTACATACTGTATGCAAGCTAGCTGATCGATCGTAGCTAGTGATGCTAGCTAC', k=5, w=11)
[4, 5, 16, 19, 21, 26, 27, 35, 39, 49, 57, 63, 68]
>>> modimizer('ACGTACGTAGCTAGCTAGCTAGCTGATTACATACTGTATGCAAGCTAGCTGATCGATCGTAGCTAGTGATGCTAGCTAC', k=5, mod=5)
[23, 34, 38, 40, 62, 67]
>>> syncmer('ACGTACGTAGCTAGCTAGCTAGCTGATTACATACTGTATGCAAGCTAGCTGATCGATCGTAGCTAGTGATGCTAGCTAC', k=5, w=15)
[0, 3, 4, 5, 7, 12, 13, 27, 35, 49]
>>> modimizer('ATCGTGCATCA', k=4, mod=2, include_hash=True)
[(0, 1122099596), (2, 249346952), (4, 227670418), (7, 123749036)]
>>> seq = 'ACGTACGTAGCTAGCTAGCTAGCTGATTACATACTGTATGCAAGCTAGCTGATCGATCGTAGCTAGTGATGCTAGCTAC'
>>> [seq[p:p+5] for p in window_minimizer(seq, k=5, w=11)]
['ACGTA', 'CGTAG', 'AGCTA', 'TAGCT', 'GCTGA', 'TTACA', 'TACAT', 'GTATG', 'GCAAG', 'TGATC', 'CGTAG', 'TAGTG', 'ATGCT']