TU DOrtmund lossless COMPression framework
☆20Sep 7, 2024Updated last year
Alternatives and similar repositories for tudocomp
Users that are interested in tudocomp are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- vector illustrations of BWT based searching on small strings☆16Apr 29, 2019Updated 7 years ago
- String Visualizer☆12Dec 18, 2025Updated 8 months ago
- Compact Tree Representation☆16Mar 16, 2017Updated 9 years ago
- Paper Collection for Stringologists☆17Aug 14, 2026Updated 2 weeks ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Jul 14, 2025Updated last year
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- Implementation of the sacabench framework☆19May 15, 2021Updated 5 years ago
- Optimal suffix sorting and LCP array construction for constant alphabets [IPL 2017]☆10Aug 17, 2018Updated 8 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14May 11, 2018Updated 8 years ago
- A tool for visualizing the internal structures of morphological analyzer Sudachi☆18Jun 9, 2022Updated 4 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 8 years ago
- Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.☆24Sep 16, 2022Updated 3 years ago
- A new lossless data compression algorithm☆12Nov 19, 2025Updated 9 months ago
- Suite of universal indexes for Highly Repetitive Document Collections☆24May 14, 2020Updated 6 years ago
- ☆21Updated this week
- Serverless GPU API endpoints on Runpod - Get Bonus Credits • AdSkip the infrastructure headaches. Auto-scaling, pay-as-you-go, no-ops approach lets you focus on innovating your application.
- Space efficient (graph) algorithms☆18Sep 10, 2020Updated 5 years ago
- Efficient construction of the BWT using string compression☆22May 26, 2026Updated 3 months ago
- Universe-sliced indexes in C++.☆18Jan 8, 2023Updated 3 years ago
- C++17 implementation of memory-efficient dynamic tries☆58Feb 15, 2022Updated 4 years ago
- Practical Dynamic de Bruijn Graphs☆18Oct 1, 2020Updated 5 years ago
- Wavelet tree based on a fixed block boosting technique☆16May 18, 2021Updated 5 years ago
- Symk is a state-of-the-art classical optimal and top-k planner.☆49Aug 24, 2026Updated last week
- Collection of Suffix Array Construction Algorithms (SACAs)☆35Mar 29, 2019Updated 7 years ago
- Inducing enhanced suffix arrays for string collections [DCC'16, TCS 2017]☆29Dec 2, 2025Updated 8 months ago
- Virtual machines for every use case on DigitalOcean • AdGet dependable uptime with 99.99% SLA, simple security tools, and predictable monthly pricing with DigitalOcean's virtual machines, called Droplets.
- Succinct Data Structure Library 3.0☆109Jul 1, 2026Updated last month
- BWT tunneling☆12Feb 4, 2018Updated 8 years ago
- Induced Suffix Array with LCP construction (Mirror)☆23Apr 24, 2012Updated 14 years ago
- An R implementation of the Gene Frequency - Inverse Cell Frequency method for single cell data normalization☆15Oct 27, 2022Updated 3 years ago
- Incremental construction of FM-index for DNA sequences☆72Jun 12, 2024Updated 2 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Nov 16, 2020Updated 5 years ago
- Simple succinct data structures (in Rust)☆54Updated this week
- Competition programming calendar (AtCoder, yukicoder, Codeforces, CS Academy)☆10Nov 6, 2018Updated 7 years ago
- A parallelized implementation of optimized MSD radix sort for strings☆27Oct 11, 2018Updated 7 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- A collection of succinct data structures☆216Jan 3, 2024Updated 2 years ago
- Bicriteria Data Compressor☆15Dec 9, 2017Updated 8 years ago
- A Go library for space-efficient rank/select operations for both sparse and dense bit arrays.☆38Jul 24, 2020Updated 6 years ago
- Learned Monotone Minimal Perfect Hashing☆32Apr 1, 2025Updated last year
- Dynamic succinct/compressed data structures☆120Dec 17, 2025Updated 8 months ago
- Native C++ Library☆49May 23, 2015Updated 11 years ago
- linear time suffix array construction algorithm☆12Oct 28, 2016Updated 9 years ago