Alternatives and similar repositories for WaveletMatrix

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

• iwiwi / radix-heap
  An implementation of radix heap
  ☆62Updated 10 years ago
• iskana / PBWT-sec
  ☆14Updated 5 years ago
• iwiwi / parallel-radix-sort
  An implementation of optimized parallel radix sort
  ☆50Updated 6 years ago
• kampersanda / xcdat
  Fast compressed trie dictionary library
  ☆71Updated last year
• stringologytimes / StringologyTimes
  Paper Collection for Stringologists
  ☆17Updated 2 months ago
• itomomoti / OnlineRlbwt
  Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.
  ☆14Updated 7 years ago
• rossanoventurini / qwt
  A Rust implementation of the Quad Wavelet Tree
  ☆43Updated last month
• kampersanda / sucds
  Collection of succinct data structures in Rust
  ☆100Updated 2 months ago
• noshi91 / Library
  競技プログラミング
  ☆38Updated 2 years ago
• thm-mni-ii / sea
  Space efficient (graph) algorithms
  ☆18Updated 5 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• kg86 / visstr
  String Visualizer
  ☆12Updated 2 years ago
• koeppl / stringsheet
  A cheatsheet for most common Stringology tasks
  ☆14Updated 4 years ago
• tudocomp / tudocomp
  TU DOrtmund lossless COMPression framework
  ☆19Updated last year
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 3 years ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆48Updated 4 years ago
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆18Updated 2 years ago
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆16Updated 4 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆111Updated last year
• tov / succinct-rs
  Succinct Data Structures for Rust
  ☆58Updated 4 months ago
• takuyaa / yada
  Yada is a yet another double-array trie library aiming for fast search and compact data representation.
  ☆42Updated last year
• nicolaprezza / r-index
  An optimal space run-length Burrows-Wheeler transform full-text index
  ☆65Updated 2 years ago
• kampersanda / tongrams-rs
  Rust library providing fast language model queries in compressed space
  ☆25Updated 3 years ago
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆25Updated 2 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• turpinandrew / shuff
  Static Huffman coding
  ☆10Updated 8 years ago
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆58Updated 3 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated last year
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 2 years ago
• davidecenzato / PFP-eBWT
  Implementation of eBWT using Prefix-free parse (PFP)
  ☆14Updated 3 months ago