A lightweight suffix-sorting library
☆419Mar 25, 2020Updated 6 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:
- The libsais library provides fast linear-time construction of suffix array (SA), generalized suffix array (GSA), longest common prefix (L…☆257Nov 9, 2026Updated last week
- Relative data structures based on the BWT☆12Apr 28, 2018Updated 8 years ago
- linear time suffix array construction algorithm☆11Oct 28, 2016Updated 10 years ago
- Parallel Lightweight Suffix Array Algorithm.☆20Dec 28, 2016Updated 9 years ago
- msufsort parallel suffix array construction algorithm☆30Nov 16, 2020Updated 6 years ago
- AI Agents on DigitalOcean Gradient AI Platform • AdBuild production-ready AI agents using customizable tools or access multiple LLMs through a single endpoint. Create custom knowledge bases or connect external data.
- A lightweight suffix-sorting library enhanced with LCP construction☆13Mar 26, 2020Updated 6 years ago
- Succinct Data Structure Library 2.0☆2,312Jun 2, 2023Updated 3 years ago
- A tool for merging large BWTs☆23Nov 26, 2020Updated 5 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Apr 25, 2022Updated 4 years ago
- gsufsort: building suffix arrays, LCP-arrays and BWTs for string collections [AMB 2020]☆28Feb 16, 2025Updated last year
- Efficient construction of the BWT using string compression☆25May 26, 2026Updated 5 months ago
- Inducing enhanced suffix arrays for string collections [DCC'16, TCS 2017]☆29Sep 9, 2026Updated 2 months ago
- compressed, queryable variation graphs☆11Jun 25, 2015Updated 11 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆72May 31, 2023Updated 3 years ago
- End-to-end encrypted email - Proton Mail • AdSpecial offer: 40% Off Yearly / 80% Off First Month. All Proton services are open source and independently audited for security.
- Lightweight String Graph Construction☆11May 10, 2023Updated 3 years ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆53Aug 12, 2019Updated 7 years ago
- Compact Tree Representation☆16Mar 16, 2017Updated 9 years ago
- External memory suffix array construction using inducing☆12Jul 27, 2020Updated 6 years ago
- fast and niubility compression library.☆88Oct 12, 2018Updated 8 years ago
- Generalized enhanced suffix array construction in external memory [CPM'13, AMB 2017]☆16Aug 9, 2021Updated 5 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Jul 14, 2025Updated last year
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Jan 3, 2024Updated 2 years ago
- Automatically exported from code.google.com/p/mmc☆31Aug 5, 2022Updated 4 years ago
- Managed Kubernetes at scale on DigitalOcean • AdDigitalOcean Kubernetes includes the control plane, bandwidth allowance, container registry, automatic updates, and more for free.
- Implementation of the sacabench framework☆20May 15, 2021Updated 5 years ago
- FM-index representation of a de Bruijn graph☆27Aug 7, 2017Updated 9 years ago
- Compact Data Structures Library☆102Jun 20, 2022Updated 4 years ago
- MEM mapper prototype☆13Nov 28, 2020Updated 5 years ago
- rANS coder (derived from https://github.com/rygorous/ryg_rans)☆92Mar 15, 2022Updated 4 years ago
- A cheatsheet for most common Stringology tasks☆15Apr 14, 2021Updated 5 years ago
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆53Mar 12, 2024Updated 2 years ago
- A collection of succinct data structures☆219Jan 3, 2024Updated 2 years ago
- Sample implementation of suffix array construction algorithm, SA-IS.☆10Aug 18, 2011Updated 15 years ago
- Deploy open-source AI quickly and easily - Special Bonus Offer • AdRunpod Hub is built for open source. One-click deployment and autoscaling endpoints without provisioning your own infrastructure.
- Compact Data Structures Library☆128Sep 4, 2014Updated 12 years ago
- BWT-based index for graphs☆72Aug 19, 2026Updated 3 months ago
- Dynamic succinct/compressed data structures☆120Dec 17, 2025Updated 11 months 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 …☆27Apr 26, 2022Updated 4 years ago
- Run-length compressed BWT with LZ77 sampled suffix array☆10Apr 25, 2022Updated 4 years ago
- Experimental parallel compression algorithm☆28Sep 24, 2017Updated 9 years ago
- High performance block-sorting data compression library☆354Updated this week
Are these results useful?