Compression Benchmark
The libsais library provides fast linear-time construction of suffix array (SA), generalized suffix array (GSA), longest common prefix (LCP) array, permuted LCP (PLCP) array, Burrows-Wheeler transform (BWT) and inverse BWT based on the induced sorting algorithm with optional OpenMP support for multi-core parallel construction.
gsufsort: building suffix arrays, LCP-arrays and BWTs for string collections [AMB 2020]
Generalized enhanced suffix array construction in external memory [CPM'13, AMB 2017]
ProPhex – an exact k-mer index using Burrows-Wheeler Transform
Glitchart generator based on compression with errors
Disk-based approach to compute the BWT and the LCP of a set of strings
🗜️ Implementation of a different approach to the traditional BWT, using ICFL.
Python C module for creating suffix, LCP and BWT arrays with UTF-8 text.
Splice-aware Tool for Alignment of Pyrosequencing Reads
This C tool implements the FM-Index Backward Search Algorithm to efficiently display matching records in BWT-RLE files without requiring decoding.
Add a description, image, and links to the bwt topic page so that developers can more easily learn about it.
To associate your repository with the bwt topic, visit your repo's landing page and select "manage topics."