String Visualizer
☆12Dec 18, 2025Updated 2 months ago
Alternatives and similar repositories for visstr
Users that are interested in visstr are comparing it to the libraries listed below
Sorting:
- Paper Collection for Stringologists☆17Feb 14, 2026Updated 2 weeks ago
- vector illustrations of BWT based searching on small strings☆16Apr 29, 2019Updated 6 years ago
- TU DOrtmund lossless COMPression framework☆19Sep 7, 2024Updated last year
- A new lossless data compression algorithm☆12Nov 19, 2025Updated 3 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
- A tool for visualizing the internal structures of morphological analyzer Sudachi☆18Jun 9, 2022Updated 3 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
- Implementation of eBWT using Prefix-free parse (PFP)☆14Jul 14, 2025Updated 7 months ago
- R-Index-F Library for Pattern Matching☆12Aug 8, 2024Updated last year
- Optimal suffix sorting and LCP array construction for constant alphabets [IPL 2017]☆10Aug 17, 2018Updated 7 years ago
- A lightweight suffix-sorting library enhanced with LCP construction☆13Mar 26, 2020Updated 5 years ago
- Compact Tree Representation☆16Mar 16, 2017Updated 8 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 7 years ago
- Space efficient (graph) algorithms☆18Sep 10, 2020Updated 5 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
- SQL linter tool for BigQuery GoogleSQL (formerly known as StandardSQL).☆17Updated this week
- Suite of universal indexes for Highly Repetitive Document Collections☆24May 14, 2020Updated 5 years ago
- A Japanese law parser☆25Jan 25, 2024Updated 2 years ago
- Collection of succinct data structures in Rust☆104Aug 1, 2025Updated 7 months ago
- C++17 implementation of memory-efficient dynamic tries☆58Feb 15, 2022Updated 4 years ago
- A tool for merging large BWTs☆24Nov 26, 2020Updated 5 years ago
- Inducing enhanced suffix arrays for string collections [DCC'16, TCS 2017]☆26Dec 2, 2025Updated 3 months ago
- Collection of Suffix Array Construction Algorithms (SACAs)☆34Mar 29, 2019Updated 6 years ago
- Competition programming calendar (AtCoder, yukicoder, Codeforces, CS Academy)☆10Nov 6, 2018Updated 7 years ago
- A test helper for Goa v3.☆12Nov 21, 2025Updated 3 months ago
- ☆13Nov 15, 2017Updated 8 years ago
- Yada is a yet another double-array trie library aiming for fast search and compact data representation.☆45Feb 25, 2024Updated 2 years ago
- Succinct Data Structure Library 3.0☆103Dec 15, 2025Updated 2 months ago
- 🧭 From Confluence to clean Markdown, images and all — just one command☆20Feb 23, 2026Updated last week
- ☆12Aug 2, 2023Updated 2 years ago
- ☆11Dec 29, 2022Updated 3 years ago
- Includes a file with zstd compression in Rust☆13Feb 17, 2023Updated 3 years ago
- suffix array construction and searching algorithms for in-memory binary data.☆12Sep 10, 2022Updated 3 years ago
- An implementation of "Subspace Representations for Soft Set Operations and Sentence Similarities" (NAACL 2024)☆10May 31, 2024Updated last year
- ☆11Sep 8, 2023Updated 2 years ago
- Another port of the original DOOM source code with SDL2 and WASM [this repository is a mirror]☆11Sep 4, 2025Updated 5 months ago
- 42 Algorithm Project - Sort problem☆11Oct 13, 2022Updated 3 years ago