A lightweight suffix-sorting library
☆402Mar 25, 2020Updated 5 years ago
Alternatives and similar repositories for libdivsufsort
Users that are interested in libdivsufsort are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Relative data structures based on the BWT☆12Apr 28, 2018Updated 7 years ago
- The libsais library provides fast linear-time construction of suffix array (SA), generalized suffix array (GSA), longest common prefix (L…☆238Sep 10, 2025Updated 6 months ago
- linear time suffix array construction algorithm☆12Oct 28, 2016Updated 9 years ago
- Parallel Lightweight Suffix Array Algorithm.☆19Dec 28, 2016Updated 9 years ago
- gsufsort: building suffix arrays, LCP-arrays and BWTs for string collections [AMB 2020]☆26Feb 16, 2025Updated last year
- msufsort parallel suffix array construction algorithm☆30Nov 16, 2020Updated 5 years ago
- A tool for merging large BWTs☆24Nov 26, 2020Updated 5 years ago
- A lightweight suffix-sorting library enhanced with LCP construction☆13Mar 26, 2020Updated 5 years ago
- Succinct Data Structure Library 2.0☆2,299Jun 2, 2023Updated 2 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Apr 25, 2022Updated 3 years ago
- compressed, queryable variation graphs☆11Jun 25, 2015Updated 10 years ago
- Inducing enhanced suffix arrays for string collections [DCC'16, TCS 2017]☆27Dec 2, 2025Updated 3 months ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆51Aug 12, 2019Updated 6 years ago
- Generalized enhanced suffix array construction in external memory [CPM'13, AMB 2017]☆17Aug 9, 2021Updated 4 years ago
- Compact Data Structures Library☆102Jun 20, 2022Updated 3 years ago
- BWT-based index for graphs☆73Mar 12, 2025Updated last year
- Experimental parallel compression algorithm☆27Sep 24, 2017Updated 8 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Jul 14, 2025Updated 8 months ago
- Efficient construction of the BWT using string compression☆21Updated this week
- A collection of succinct data structures☆213Jan 3, 2024Updated 2 years ago
- Run-length compressed BWT with LZ77 sampled suffix array☆10Apr 25, 2022Updated 3 years ago
- A cheatsheet for most common Stringology tasks☆14Apr 14, 2021Updated 4 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆68May 31, 2023Updated 2 years ago
- A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …☆26Apr 26, 2022Updated 3 years ago
- Optimal suffix sorting and LCP array construction for constant alphabets [IPL 2017]☆10Aug 17, 2018Updated 7 years ago
- Wavelet tree based on a fixed block boosting technique☆16May 18, 2021Updated 4 years ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆110Jan 22, 2015Updated 11 years ago
- Automatically exported from code.google.com/p/mmc☆29Aug 5, 2022Updated 3 years ago
- fast and niubility compression library.☆89Oct 12, 2018Updated 7 years ago
- Dynamic succinct/compressed data structures☆117Dec 17, 2025Updated 3 months ago
- Implementation of the sacabench framework☆19May 15, 2021Updated 4 years ago
- This repo is deprecated. Please use gfatools instead.☆15Aug 17, 2018Updated 7 years ago
- Fast and Strong Burrows Wheeler Model☆20Nov 6, 2018Updated 7 years ago
- Compact Tree Representation☆16Mar 16, 2017Updated 9 years ago
- Fastest Integer Compression☆828Mar 1, 2024Updated 2 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 7 years ago
- High performance block-sorting data compression library☆343Feb 3, 2026Updated last month
- Collection of techniques for (binary) string searching☆25Nov 23, 2019Updated 6 years ago
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆53Mar 12, 2024Updated 2 years ago