Succinct Data Structure Library 3.0
-
Updated
Sep 9, 2024 - C++
Succinct Data Structure Library 3.0
libsais is a library for linear time suffix array, longest common prefix array and burrows wheeler transform construction based on induced sorting algorithm.
Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays
gsufsort: building suffix arrays, LCP-arrays and BWTs for string collections [AMB 2020]
Inducing enhanced suffix arrays for string collections [DCC'16, TCS 2017]
Algorithm design course in my forth semester of university
Data Structures naively implemented in Kotlin for learning purpose
External memory BWT and LCP computation for sequence collections with applications [WABI'18, AMB 2019]
Generalized enhanced suffix array construction in external memory [CPM'13, AMB 2017]
Multi-threaded approach to compute the BWT and the LCP array of a set of strings
msufsort parallel suffix array construction algorithm
Disk-based approach to compute the BWT and the LCP of a set of strings
A lightweight suffix-sorting library enhanced with LCP construction
Induced Suffix Array and LCP construction based on the SAIS algorithm.
Algorihms about Suffix Array Construction, Suffix Tree, Longest Common Prefix, Burrows Wheeler Transform,
Python C module for creating suffix, LCP and BWT arrays with UTF-8 text.
Burrows-Wheeler transform and LCP array construction in constant space [IWOCA'15, JDA 2017]
Optimal suffix sorting and LCP array construction for constant alphabets [IPL 2017]
Bioinformatics course project: Computing the LCP array based on BWT
Add a description, image, and links to the lcp-array topic page so that developers can more easily learn about it.
To associate your repository with the lcp-array topic, visit your repo's landing page and select "manage topics."