TU DOrtmund lossless COMPression framework
☆19Sep 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:
- String Visualizer☆12Dec 18, 2025Updated 5 months ago
- Compact Tree Representation☆16Mar 16, 2017Updated 9 years ago
- Paper Collection for Stringologists☆17Mar 29, 2026Updated last month
- Implementation of eBWT using Prefix-free parse (PFP)☆14Jul 14, 2025Updated 10 months ago
- Implementation of the sacabench framework☆19May 15, 2021Updated 5 years ago
- Bare Metal GPUs on DigitalOcean Gradient AI • AdPurpose-built for serious AI teams training foundational models, running large-scale inference, and pushing the boundaries of what's possible.
- Optimal suffix sorting and LCP array construction for constant alphabets [IPL 2017]☆10Aug 17, 2018Updated 7 years ago
- A tool for merging large BWTs☆23Nov 26, 2020Updated 5 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
- ☆21Apr 24, 2026Updated 3 weeks ago
- A tool for visualizing the internal structures of morphological analyzer Sudachi☆18Jun 9, 2022Updated 3 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 7 years ago
- A new lossless data compression algorithm☆12Nov 19, 2025Updated 6 months ago
- Suite of universal indexes for Highly Repetitive Document Collections☆24May 14, 2020Updated 6 years ago
- A parallelized implementation of optimized MSD radix sort for strings☆27Oct 11, 2018Updated 7 years ago
- Managed Kubernetes at scale on DigitalOcean • AdDigitalOcean Kubernetes includes the control plane, bandwidth allowance, container registry, automatic updates, and more for free.
- Space efficient (graph) algorithms☆18Sep 10, 2020Updated 5 years ago
- Universe-sliced indexes in C++.☆18Jan 8, 2023Updated 3 years ago
- Relational Features for Planning☆15Mar 27, 2026Updated last month
- 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
- Incremental construction of FM-index for DNA sequences☆72Jun 12, 2024Updated last year
- Wavelet tree based on a fixed block boosting technique☆16May 18, 2021Updated 5 years ago
- A library for constructing and evaluating state features made up of description logics for planning.☆12Mar 17, 2025Updated last year
- Collection of Suffix Array Construction Algorithms (SACAs)☆34Mar 29, 2019Updated 7 years ago
- 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.
- Inducing enhanced suffix arrays for string collections [DCC'16, TCS 2017]☆27Dec 2, 2025Updated 5 months ago
- Succinct Data Structure Library 3.0☆105Apr 27, 2026Updated 3 weeks ago
- BWT tunneling☆12Feb 4, 2018Updated 8 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Nov 16, 2020Updated 5 years ago
- Competition programming calendar (AtCoder, yukicoder, Codeforces, CS Academy)☆10Nov 6, 2018Updated 7 years ago
- MEM mapper prototype☆13Nov 28, 2020Updated 5 years ago
- ☆49Nov 18, 2024Updated last year
- Graph Learning for Planning☆27Mar 27, 2026Updated last month
- SUccinct Retrieval Framework☆21Jan 24, 2016Updated 10 years ago
- GPU virtual machines on DigitalOcean Gradient AI • AdGet to production fast with high-performance AMD and NVIDIA GPUs you can spin up in seconds. The definition of operational simplicity.
- A C++ library for encoding and decoding different data types into bytes☆24Feb 1, 2015Updated 11 years ago
- Bicriteria Data Compressor☆15Dec 9, 2017Updated 8 years ago
- Learned Monotone Minimal Perfect Hashing☆31Apr 1, 2025Updated last year
- FM-index representation of a de Bruijn graph☆26Aug 7, 2017Updated 8 years ago
- A Go library for space-efficient rank/select operations for both sparse and dense bit arrays.☆38Jul 24, 2020Updated 5 years ago
- Dynamic succinct/compressed data structures☆118Dec 17, 2025Updated 5 months ago
- A ball-tree implementation for K-NN☆18Jan 8, 2026Updated 4 months ago