Alternatives and similar repositories for visstr

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

• tudocomp / tudocomp
  TU DOrtmund lossless COMPression framework
  ☆19Updated last year
• koeppl / stringsheet
  A cheatsheet for most common Stringology tasks
  ☆14Updated 4 years ago
• itomomoti / OnlineRlbwt
  Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.
  ☆14Updated 7 years ago
• drnatebrown / r-index-f
  R-Index-F Library for Pattern Matching
  ☆12Updated last year
• sacabench / sacabench
  Implementation of the sacabench framework
  ☆18Updated 4 years ago
• stringologytimes / StringologyTimes
  Paper Collection for Stringologists
  ☆17Updated last week
• takuyaa / ja-law-parser
  A Japanese law parser
  ☆25Updated last year
• nicolaprezza / r-index
  An optimal space run-length Burrows-Wheeler transform full-text index
  ☆66Updated 2 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• felipelouza / gsa-is
  Inducing enhanced suffix arrays for string collections [DCC'16, TCS 2017]
  ☆26Updated last month
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated 3 weeks ago
• MitI-7 / WaveletMatrix
  implementation of dynamic wavelet matrix(tree) and static wavelet matrix
  ☆23Updated 6 years ago
• iwiwi / parallel-string-radix-sort
  A parallelized implementation of optimized MSD radix sort for strings
  ☆27Updated 7 years ago
• daac-tools / crawdad
  🦞 Rust library of natural language dictionaries using character-wise double-array tries.
  ☆36Updated 11 months ago
• ikawaha / encoding
  ☆10Updated 4 years ago
• davidecenzato / PFP-eBWT
  Implementation of eBWT using Prefix-free parse (PFP)
  ☆14Updated 5 months ago
• iskana / PBWT-sec
  ☆14Updated 5 years ago
• takuyaa / yada
  Yada is a yet another double-array trie library aiming for fast search and compact data representation.
  ☆44Updated last year
• iwiwi / radix-heap
  An implementation of radix heap
  ☆64Updated 10 years ago
• qnighy / omniswap
  a crate to swap values between possibly-overlapping references
  ☆23Updated 3 years ago
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆101Updated 3 weeks ago
• kurpicz / saca-bench
  Collection of Suffix Array Construction Algorithms (SACAs)
  ☆33Updated 6 years ago
• WorksApplications / ViSudachi
  A tool for visualizing the internal structures of morphological analyzer Sudachi
  ☆18Updated 3 years ago
• ekg / drawbwt
  vector illustrations of BWT based searching on small strings
  ☆16Updated 6 years ago
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆16Updated 4 years ago
• oreilly-japan / building-search-app-w-ml
  『機械学習による検索ランキング改善ガイド』のサンプルコードのリポジトリ
  ☆22Updated 2 years ago
• k-yomo / ostrich
  WIP: Full text search engine library written in Go with 1.18+ Generics, heavily inspired by Tantivy
  ☆14Updated 2 years ago
• kumagi / tinylamb
  Sample implementation of RDBMS.
  ☆21Updated 5 months ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆48Updated 4 years ago
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆58Updated 3 years ago