The Split Sequence Bloom Tree (SSBT) is a method that will allow you to index a set of
short-read sequencing experiments and then query them quickly for a given
sequence. The code base provided here is an implementation of SSBT written in
C++ and is open source.
To install using the source:
- Install gcc (Version 4.9.1 or later)
- Install Jellyfish (Version 2.2.0 or later)
- Install SDSL-lite (Version 2.0 or later recommended)
- Download the latest version of SBT using Github
- Compile:
cd ssbt2017/src
make
For further details please refer to the user manual (user_manual/ssbt-manual.pdf)
If you use this work, please cite:
The current SSBT implementation uses the SDSL library under the GNU General
Public License (GPLv3) and is also freely distributed under the same license.
If you use SSBT please also cite the following paper:
Gog, Simon and Beller, Timo and Moffat, Alistair and petri, Matthias.
From Theory to Practice: Plug and Play with Succinct Data Structures.
13th International Symposium on Experimental Algorithms (SEA 2014).
doi: http://dx.doi.org/10.1007/978-3-319-07959-2_28