TU DOrtmund lossless COMPression framework
☆20Sep 7, 2024Updated 2 years ago
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☆13Sep 12, 2026Updated 2 months ago
- LZ Double factor Factorization.☆11Feb 26, 2017Updated 9 years ago
- Paper Collection for Stringologists☆17Updated this week
- Compact Tree Representation☆16Mar 16, 2017Updated 9 years ago
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click. Zero configuration with optimized deployments.
- A blend of the compact and sparse hash table implementations.☆15Aug 20, 2021Updated 5 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Jul 14, 2025Updated last year
- Implementation of the sacabench framework☆20May 15, 2021Updated 5 years ago
- A cheatsheet for most common Stringology tasks☆15Apr 14, 2021Updated 5 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆24May 14, 2020Updated 6 years ago
- External memory suffix array construction using inducing☆12Jul 27, 2020Updated 6 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
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 8 years ago
- A tool for visualizing the internal structures of morphological analyzer Sudachi☆18Jun 9, 2022Updated 4 years ago
- 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.
- Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.☆24Sep 16, 2022Updated 4 years ago
- A new lossless data compression algorithm☆12Sep 9, 2026Updated 2 months ago
- Simple succinct data structures (in Rust)☆56Sep 14, 2026Updated 2 months ago
- C++17 implementation of memory-efficient dynamic tries☆59Feb 15, 2022Updated 4 years ago
- Space efficient (graph) algorithms☆17Sep 10, 2020Updated 6 years ago
- Universe-sliced indexes in C++.☆19Jan 8, 2023Updated 3 years ago
- Wavelet tree based on a fixed block boosting technique☆17May 18, 2021Updated 5 years ago
- Efficient construction of the BWT using string compression☆25May 26, 2026Updated 5 months ago
- Lightweight String Graph Construction☆11May 10, 2023Updated 3 years ago
- Managed Database hosting by DigitalOcean • AdPostgreSQL, MySQL, MongoDB, Kafka, Valkey, and OpenSearch available. Automatically scale up storage and focus on building your apps.
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Apr 25, 2022Updated 4 years ago
- Inducing enhanced suffix arrays for string collections [DCC'16, TCS 2017]☆29Sep 9, 2026Updated 2 months ago
- C++ library for creating and manipulating decision diagrams.☆14Apr 20, 2026Updated 6 months ago
- Incremental construction of FM-index for DNA sequences☆72Jun 12, 2024Updated 2 years ago
- BWT tunneling☆12Feb 4, 2018Updated 8 years ago
- Succinct Data Structure Library 3.0☆112Updated this week
- An R implementation of the Gene Frequency - Inverse Cell Frequency method for single cell data normalization☆16Oct 27, 2022Updated 4 years ago
- A parallelized implementation of optimized MSD radix sort for strings☆27Oct 11, 2018Updated 8 years ago
- MEM mapper prototype☆13Nov 28, 2020Updated 5 years 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.
- Relative data structures based on the BWT☆12Apr 28, 2018Updated 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
- linear time suffix array construction algorithm☆11Oct 28, 2016Updated 10 years ago
- A ball-tree implementation for K-NN☆18Jan 8, 2026Updated 10 months ago
- Squanchy is a brand new, easy to learn, general purpose, multi-paradigm, compiled programming language. The language is written from scra…☆15Dec 7, 2019Updated 6 years ago
- Dynamic succinct/compressed data structures☆120Dec 17, 2025Updated 11 months ago
- MAW: a suite on the computation and application of Minimal Absent Words☆18Nov 1, 2021Updated 5 years ago
Are these results useful?