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 11 months ago
• koeppl / stringsheet
  A cheatsheet for most common Stringology tasks
  ☆15Updated 4 years ago
• MitI-7 / WaveletMatrix
  implementation of dynamic wavelet matrix(tree) and static wavelet matrix
  ☆22Updated 6 years ago
• itomomoti / OnlineRlbwt
  Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.
  ☆15Updated 7 years ago
• WorksApplications / ViSudachi
  A tool for visualizing the internal structures of morphological analyzer Sudachi
  ☆17Updated 3 years ago
• stringologytimes / StringologyTimes
  Paper Collection for Stringologists
  ☆17Updated 3 weeks ago
• drnatebrown / r-index-f
  R-Index-F Library for Pattern Matching
  ☆13Updated last year
• sacabench / sacabench
  Implementation of the sacabench framework
  ☆17Updated 4 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• takuyaa / ja-law-parser
  A Japanese law parser
  ☆23Updated last year
• daac-tools / crawdad
  🦞 Rust library of natural language dictionaries using character-wise double-array tries.
  ☆31Updated 6 months ago
• iwiwi / parallel-string-radix-sort
  A parallelized implementation of optimized MSD radix sort for strings
  ☆27Updated 6 years ago
• iskana / PBWT-sec
  ☆13Updated 5 years ago
• qnighy / omniswap
  a crate to swap values between possibly-overlapping references
  ☆23Updated 2 years ago
• oreilly-japan / building-search-app-w-ml
  『機械学習による検索ランキング改善ガイド』のサンプルコードのリポジトリ
  ☆21Updated 2 years ago
• kampersanda / dyft
  C++17 Implementation of Dynamic Filter Trie
  ☆8Updated 3 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆113Updated last year
• nicolaprezza / r-index
  An optimal space run-length Burrows-Wheeler transform full-text index
  ☆66Updated 2 years ago
• mocobeta / lucene-postings-format
  At-a-glance overview diagrams of Apache Lucene's default PostingsFormat (inverted index binary format).
  ☆80Updated 2 years ago
• takuyaa / yada
  Yada is a yet another double-array trie library aiming for fast search and compact data representation.
  ☆41Updated last year
• iwiwi / radix-heap
  An implementation of radix heap
  ☆62Updated 10 years ago
• iwiwi / parallel-radix-sort
  An implementation of optimized parallel radix sort
  ☆49Updated 6 years ago
• ikawaha / encoding
  ☆10Updated 3 years ago
• felipelouza / gsa-is
  Inducing enhanced suffix arrays for string collections [DCC'16, TCS 2017]
  ☆26Updated 2 years ago
• kunisura / TdZdd
  A top-down/breadth-first decision diagram manipulation framework
  ☆60Updated last week
• kampersanda / sucds
  Collection of succinct data structures in Rust
  ☆99Updated last week
• davidecenzato / PFP-eBWT
  Implementation of eBWT using Prefix-free parse (PFP)
  ☆14Updated 3 weeks ago
• kurpicz / saca-bench
  Collection of Suffix Array Construction Algorithms (SACAs)
  ☆33Updated 6 years ago
• comp-prog-jp-library-standard / competitive-programming-library
  競技プログラミング用共通ライブラリ
  ☆46Updated 2 years ago
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆58Updated 3 years ago