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
Sorting:
- String Visualizer☆12Dec 18, 2025Updated 2 months ago
- vector illustrations of BWT based searching on small strings☆16Apr 29, 2019Updated 6 years ago
- Paper Collection for Stringologists☆17Feb 14, 2026Updated 2 weeks ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Jul 14, 2025Updated 7 months ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14May 11, 2018Updated 7 years ago
- Compact Tree Representation☆16Mar 16, 2017Updated 8 years ago
- A cheatsheet for most common Stringology tasks☆14Apr 14, 2021Updated 4 years ago
- Implementation of the sacabench framework☆19May 15, 2021Updated 4 years ago
- A tool for merging large BWTs☆24Nov 26, 2020Updated 5 years ago
- Optimal suffix sorting and LCP array construction for constant alphabets [IPL 2017]☆10Aug 17, 2018Updated 7 years ago
- A new lossless data compression algorithm☆12Nov 19, 2025Updated 3 months ago
- Universe-sliced indexes in C++.☆18Jan 8, 2023Updated 3 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 7 years ago
- A tool for visualizing the internal structures of morphological analyzer Sudachi☆18Jun 9, 2022Updated 3 years ago
- A parallelized implementation of optimized MSD radix sort for strings☆27Oct 11, 2018Updated 7 years ago
- Efficient construction of the BWT using string compression☆21Jun 3, 2025Updated 8 months ago
- Space efficient (graph) algorithms☆18Sep 10, 2020Updated 5 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆24May 14, 2020Updated 5 years ago
- An R implementation of the Gene Frequency - Inverse Cell Frequency method for single cell data normalization☆15Oct 27, 2022Updated 3 years ago
- A ball-tree implementation for K-NN☆18Jan 8, 2026Updated last month
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Apr 25, 2022Updated 3 years ago
- Succinct Data Structure Library 3.0☆103Dec 15, 2025Updated 2 months ago
- Incremental construction of FM-index for DNA sequences☆72Jun 12, 2024Updated last year
- Dynamic succinct/compressed data structures☆116Dec 17, 2025Updated 2 months ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆68May 31, 2023Updated 2 years ago
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆36Jan 15, 2025Updated last year
- A package for building customizable decision trees and random forests.☆10Oct 6, 2025Updated 4 months ago
- A Go library for space-efficient rank/select operations for both sparse and dense bit arrays.☆38Jul 24, 2020Updated 5 years ago
- Rectified Factor Networks☆37Oct 16, 2019Updated 6 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Nov 16, 2020Updated 5 years ago
- Symk is a state-of-the-art classical optimal and top-k planner.☆43Dec 16, 2025Updated 2 months ago
- GURLS: a Least Squares Library for Supervised Learning☆62Jun 9, 2016Updated 9 years ago
- ☆46Nov 18, 2024Updated last year
- Proximal Asynchronous SAGA☆13Nov 30, 2017Updated 8 years ago
- ☆11Feb 16, 2021Updated 5 years ago
- FTRL-Proximal Online Learning Algorithm☆15May 22, 2017Updated 8 years ago
- Automatically exported from code.google.com/p/malder☆11Mar 17, 2015Updated 10 years ago
- A Simple Algorithm for Minimum Cuts in Near-Linear Time (SWAT '20)☆12Apr 24, 2020Updated 5 years ago
- Benchmarks of artificial neural network library for Spark MLlib☆11Dec 3, 2015Updated 10 years ago