Space efficient (graph) algorithms
☆17Sep 10, 2020Updated 6 years ago
Alternatives and similar repositories for sea
Users that are interested in sea are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- FSA compression paper, data sets and software.☆11Mar 30, 2012Updated 14 years ago
- A tool for visualizing the internal structures of morphological analyzer Sudachi☆18Jun 9, 2022Updated 4 years ago
- A blend of the compact and sparse hash table implementations.☆15Aug 20, 2021Updated 5 years ago
- vector illustrations of BWT based searching on small strings☆16Apr 29, 2019Updated 7 years ago
- String Visualizer☆13Sep 12, 2026Updated 2 months 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 cheatsheet for most common Stringology tasks☆15Apr 14, 2021Updated 5 years ago
- An Efficient Language Model Using Double-Array Structures☆17Aug 10, 2020Updated 6 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Updated this week
- Dictionary-based compression for inverted indexes.☆23Mar 22, 2019Updated 7 years ago
- Paper Collection for Stringologists☆17Updated this week
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆15Jun 28, 2022Updated 4 years ago
- ☆14Feb 7, 2020Updated 6 years ago
- TU DOrtmund lossless COMPression framework☆20Sep 7, 2024Updated 2 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Nov 10, 2021Updated 5 years ago
- Managed hosting for WordPress and PHP on Cloudways • AdManaged hosting for WordPress, Magento, Laravel, or PHP apps, on multiple cloud providers. Deploy in minutes on Cloudways by DigitalOcean.
- ☆14May 1, 2026Updated 6 months ago
- 🦞 Rust library of natural language dictionaries using character-wise double-array tries.☆40Aug 12, 2026Updated 3 months ago
- C++17 implementation of memory-efficient dynamic tries☆59Feb 15, 2022Updated 4 years ago
- Induced Suffix Array with LCP construction (Mirror)☆23Apr 24, 2012Updated 14 years ago
- Compact Tree Representation☆16Mar 16, 2017Updated 9 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
- Relative data structures based on the BWT☆12Apr 28, 2018Updated 8 years ago
- Probabilistic data structures and sketching algorithms in Clojure☆13May 27, 2026Updated 5 months ago
- Suite of universal indexes for Highly Repetitive Document Collections☆24May 14, 2020Updated 6 years ago
- Deploy open-source AI quickly and easily - Special Bonus Offer • AdRunpod Hub is built for open source. One-click deployment and autoscaling endpoints without provisioning your own infrastructure.
- ☆22Nov 16, 2025Updated last year
- Optimizing database queries with array programming☆20Sep 21, 2020Updated 6 years ago
- An implementation of radix heap☆67May 16, 2015Updated 11 years ago
- C++ Library implementing Compressed String Dictionaries☆47Apr 25, 2022Updated 4 years ago
- Collection of Suffix Array Construction Algorithms (SACAs)☆36Mar 29, 2019Updated 7 years ago
- RPG dice roller with both Rust CLI and ClojureScript Web interfaces☆14Nov 30, 2018Updated 7 years ago
- Efficient construction of the BWT using string compression☆25May 26, 2026Updated 5 months ago
- Runs benchmarks against a range of Clojurescript versions and reports the results☆10Aug 30, 2012Updated 14 years ago
- ☆28Mar 23, 2017Updated 9 years ago
- AI Agents on DigitalOcean Gradient AI Platform • AdBuild production-ready AI agents using customizable tools or access multiple LLMs through a single endpoint. Create custom knowledge bases or connect external data.
- A self-hosted workspace where people and AI agents share one memory: chat, wiki, knowledge bases, an accounting book and a code repositor…☆13Nov 7, 2026Updated last week
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆59Jan 27, 2023Updated 3 years ago
- A C++ library to benchmark inverted indexes.☆25Aug 4, 2020Updated 6 years ago
- 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 fast, low-memory Clojure language server☆19Nov 8, 2026Updated last week
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Jan 8, 2023Updated 3 years ago
- Collection of succinct data structures in Rust☆107Oct 25, 2026Updated 3 weeks ago
Are these results useful?