Poyias / mBonsai

Related projects ⓘ

Alternatives and complementary repositories for mBonsai

• itomomoti / OnlineRlbwt
  Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.
  ☆14Updated 6 years ago
• tudocomp / tudocomp
  TU DOrtmund lossless COMPression framework
  ☆17Updated 2 months ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆62Updated 5 months ago
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆16Updated 3 years ago
• nicolaprezza / BWTIL
  BWT Text Indexing Library: a set of tools to work with BWT-based text indexes
  ☆25Updated 2 years ago
• kg86 / lzd
  LZ Double factor Factorization.
  ☆11Updated 7 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 3 years ago
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 11 years ago
• waYne1337 / gsaca
  linear time suffix array construction algorithm
  ☆12Updated 8 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated last year
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 3 years ago
• koeppl / separate_chaining
  Hash table with separate chaining layout
  ☆9Updated 3 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆53Updated 10 months ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated 6 months ago
• tkbtkysms / solca
  A Space-Optimal Grammar Compression
  ☆10Updated 3 years ago
• nicolaprezza / lz-rlbwt
  Run-length compressed BWT with LZ77 sampled suffix array
  ☆10Updated 2 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆98Updated 2 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 2 months ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 2 years ago
• nicola-gigante / bitvector
  A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …
  ☆22Updated 2 years ago
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆57Updated 2 years ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆13Updated 2 years ago
• drnatebrown / r-index-f
  R-Index-F Library for Pattern Matching
  ☆13Updated 3 months ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 4 years ago
• jltsiren / relative-fm
  Relative data structures based on the BWT
  ☆12Updated 6 years ago
• rchikhi / benchmphf
  Benchmark of four minimal perfect hash libraries (phf, emphf, CMPH, Sux4J)
  ☆13Updated 7 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 4 years ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 3 years ago
• ByteHamster / SicHash
  A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.
  ☆15Updated this week