ParaBWT 1.0.8 – Parallel Burrows Wheeler Transform Construction

ParaBWT 1.0.8

:: DESCRIPTION

ParaBWT is a new and practical parallelized Burrows-Wheeler transform (BWT) and suffix array construction algorithm for big genome data, which has a linear space complexity with a small constant factor.

::DEVELOPER

Liu, Yongchao

:: SCREENSHOTS

N/A

:: REQUIREMENTS

  • Linux

:: DOWNLOAD

ParaBWT 

:: MORE INFORMATION

Citation:

Liu Y, Hankeln T, Schmidt B.
Parallel and Space-Efficient Construction of Burrows-Wheeler Transform and Suffix Array for Big Genome Data.
IEEE/ACM Trans Comput Biol Bioinform. 2016 May-Jun;13(3):592-8. doi: 10.1109/TCBB.2015.2430314. PMID: 27295644.

sBWT 1.0b1 – Burrows–Wheeler transform (BWT) based Fast Indexer/Aligner

sBWT 1.0b1

:: DESCRIPTION

sBWT is a Burrows–Wheeler transform (BWT) based fast indexer/aligner specialized in parallelized indexing and searching for Next Generation Sequencing data.

::DEVELOPER

sBWT team

:: SCREENSHOTS

N/A

:: REQUIREMENTS

  • Linux
  • C++ compiler

:: DOWNLOAD

 sBWT

:: MORE INFORMATION

Citation

sBWT: Memory Efficient Implementation of the Hardware-acceleration-friendly Schindler Transform for the Fast Biological Sequence Mapping.
Chang CH, Chou MT, Wu YC, Hong TW, Li YL, Yang CH, Hung JH.
Bioinformatics. 2016 Jul 13. pii: btw419.