kg86 / visstrLinks
String Visualizer
☆12Updated 2 years ago
Alternatives and similar repositories for visstr
Users that are interested in visstr are comparing it to the libraries listed below
Sorting:
- TU DOrtmund lossless COMPression framework☆19Updated last year
- A cheatsheet for most common Stringology tasks☆14Updated 4 years ago
- Implementation of the sacabench framework☆18Updated 4 years ago
- Paper Collection for Stringologists☆17Updated 3 weeks ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14Updated 7 years ago
- A parallelized implementation of optimized MSD radix sort for strings☆27Updated 7 years ago
- R-Index-F Library for Pattern Matching☆12Updated last year
- A Japanese law parser☆25Updated last year
- An optimal space run-length Burrows-Wheeler transform full-text index☆66Updated 2 years ago
- Compact Tree Representation☆16Updated 8 years ago
- Dynamic succinct/compressed data structures☆112Updated this week
- Inducing enhanced suffix arrays for string collections [DCC'16, TCS 2017]☆26Updated 2 weeks ago
- a crate to swap values between possibly-overlapping references☆23Updated 3 years ago
- An implementation of radix heap☆64Updated 10 years ago
- 🦞 Rust library of natural language dictionaries using character-wise double-array tries.☆36Updated 11 months ago
- implementation of dynamic wavelet matrix(tree) and static wavelet matrix☆23Updated 6 years ago
- Yada is a yet another double-array trie library aiming for fast search and compact data representation.☆44Updated last year
- ☆14Updated 5 years ago
- A tool for visualizing the internal structures of morphological analyzer Sudachi☆18Updated 3 years ago
- At-a-glance overview diagrams of Apache Lucene's default PostingsFormat (inverted index binary format).☆81Updated 2 years ago
- C++17 implementation of memory-efficient dynamic tries☆58Updated 3 years ago
- C++ Implementation of Zip Trees☆14Updated 3 years ago
- An implementation of optimized parallel radix sort☆50Updated 7 years ago
- Succinct Data Structure Library 3.0☆99Updated this week
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- 『機械学習による検索ランキング改善ガイド』のサンプルコードのリポジトリ☆21Updated 2 years ago
- Sample implementation of RDBMS.☆21Updated 5 months ago
- WIP: Full text search engine library written in Go with 1.18+ Generics, heavily inspired by Tantivy☆14Updated 2 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Updated 5 months ago
- Dependency Parser with Easy-First Algorithm written in Go.☆10Updated 3 weeks ago