elventear / sais-lite-lcpLinks
Induced Suffix Array with LCP construction (Mirror)
☆23Updated 13 years ago
Alternatives and similar repositories for sais-lite-lcp
Users that are interested in sais-lite-lcp are comparing it to the libraries listed below
Sorting:
- linear time suffix array construction algorithm☆12Updated 9 years ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆108Updated 10 years ago
- A lightweight suffix-sorting library☆397Updated 5 years ago
- Dynamic succinct/compressed data structures☆114Updated last month
- TU DOrtmund lossless COMPression framework☆19Updated last year
- Induced Suffix Array and LCP construction based on the SAIS algorithm.☆11Updated 6 years ago
- Succinct Data Structure Library☆109Updated 12 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆65Updated last year
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14Updated 7 years ago
- Succinct Data Structure Library 3.0☆101Updated last month
- Parallel Lightweight Suffix Array Algorithm.☆18Updated 9 years ago
- Bloom-filter based minimal perfect hash function library☆270Updated 6 months ago
- Compact Data Structures Library☆129Updated 11 years ago
- SUccinct Retrieval Framework☆21Updated 9 years ago
- Compact Data Structures Library☆101Updated 3 years ago
- Collection of Suffix Array Construction Algorithms (SACAs)☆33Updated 6 years ago
- A space-efficient compressor based on the Re-Pair grammar☆10Updated 8 years ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆51Updated 6 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated 2 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- A collection of succinct data structures☆211Updated 2 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆67Updated 2 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆24Updated 5 years ago
- Performs memory-efficient reservoir sampling on very large input files delimited by newlines☆69Updated 5 years ago
- Compact Tree Representation☆16Updated 8 years ago
- Implementation of the sacabench framework☆18Updated 4 years ago
- compressed, queryable variation graphs☆11Updated 10 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 7 years ago