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.

Succinct Data Structure Library 3.0

msufsort parallel suffix array construction algorithm

gsufsort: building suffix arrays, LCP-arrays and BWTs for string collections [AMB 2020]

Inducing enhanced suffix arrays for string collections [DCC'16, TCS 2017]

Generalized enhanced suffix array construction in external memory [CPM'13, AMB 2017]

Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays

Algorihms about Suffix Array Construction, Suffix Tree, Longest Common Prefix, Burrows Wheeler Transform,

A lightweight suffix-sorting library enhanced with LCP construction

Induced Suffix Array and LCP construction based on the SAIS algorithm.

Optimal suffix sorting and LCP array construction for constant alphabets [IPL 2017]

Algorithm design course in my forth semester of university

External memory BWT and LCP computation for sequence collections with applications [WABI'18, AMB 2019]

Data Structures naively implemented in Kotlin for learning purpose

Burrows-Wheeler transform and LCP array construction in constant space [IWOCA'15, JDA 2017]

Multi-threaded approach to compute the BWT and the LCP array of a set of strings

Disk-based approach to compute the BWT and the LCP of a set of strings

Bioinformatics course project: Computing the LCP array based on BWT

Python C module for creating suffix, LCP and BWT arrays with UTF-8 text.