Alternatives and similar repositories for visstr:

Users that are interested in visstr are comparing it to the libraries listed below

• koeppl / stringsheet
  A cheatsheet for most common Stringology tasks
  ☆15Updated 3 years ago
• tudocomp / tudocomp
  TU DOrtmund lossless COMPression framework
  ☆17Updated 4 months ago
• sacabench / sacabench
  Implementation of the sacabench framework
  ☆15Updated 3 years ago
• stringologytimes / StringologyTimes
  Paper Collection for Stringologists
  ☆16Updated 2 months ago
• itomomoti / OnlineRlbwt
  Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.
  ☆15Updated 6 years ago
• drnatebrown / r-index-f
  R-Index-F Library for Pattern Matching
  ☆13Updated 5 months ago
• kg86 / lzd
  LZ Double factor Factorization.
  ☆11Updated 7 years ago
• felipelouza / gsa-is
  Inducing enhanced suffix arrays for string collections [DCC'16, TCS 2017]
  ☆25Updated last year
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆16Updated 3 years ago
• WorksApplications / ViSudachi
  A tool for visualizing the internal structures of morphological analyzer Sudachi
  ☆17Updated 2 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 7 years ago
• MitI-7 / WaveletMatrix
  implementation of dynamic wavelet matrix(tree) and static wavelet matrix
  ☆21Updated 5 years ago
• kurpicz / saca-bench
  Collection of Suffix Array Construction Algorithms (SACAs)
  ☆27Updated 5 years ago
• iwiwi / parallel-radix-sort
  An implementation of optimized parallel radix sort
  ☆47Updated 6 years ago
• kampersanda / tongrams-rs
  Rust library providing fast language model queries in compressed space
  ☆23Updated 2 years ago
• ekg / drawbwt
  vector illustrations of BWT based searching on small strings
  ☆16Updated 5 years ago
• takuyaa / yada
  Yada is a yet another double-array trie library aiming for fast search and compact data representation.
  ☆34Updated 10 months ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated 8 months ago
• nicolaprezza / r-index
  An optimal space run-length Burrows-Wheeler transform full-text index
  ☆61Updated last year
• daac-tools / crawdad
  🦞 Rust library of natural language dictionaries using character-wise double-array tries.
  ☆29Updated this week
• vicLeva / bqf
  Implementation of a Backpack Quotient Filter
  ☆11Updated 5 months ago
• iwiwi / parallel-string-radix-sort
  A parallelized implementation of optimized MSD radix sort for strings
  ☆27Updated 6 years ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago
• iskana / PBWT-sec
  ☆12Updated 4 years ago
• jamshed / CaPS-SA
  Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays
  ☆10Updated 4 months ago
• qnighy / omniswap
  a crate to swap values between possibly-overlapping references
  ☆23Updated 2 years ago
• kampersanda / dyft
  C++17 Implementation of Dynamic Filter Trie
  ☆8Updated 3 years ago
• ajalab / fm-index
  FM-Index for Rust
  ☆9Updated this week
• felipelouza / sacak-lcp
  Optimal suffix sorting and LCP array construction for constant alphabets [IPL 2017]
  ☆9Updated 6 years ago
• k-yomo / ostrich
  WIP: Full text search engine library written in Go with 1.18+ Generics, heavily inspired by Tantivy
  ☆15Updated last year