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
:: 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.