Alternatives and similar repositories for DYNAMIC:

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

• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆94Updated 4 months ago
• nicolaprezza / BWTIL
  BWT Text Indexing Library: a set of tools to work with BWT-based text indexes
  ☆25Updated 2 years ago
• nicolaprezza / r-index
  An optimal space run-length Burrows-Wheeler transform full-text index
  ☆61Updated last year
• fclaude / libcds
  Compact Data Structures Library
  ☆124Updated 10 years ago
• mpetri / FM-Index
  FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…
  ☆104Updated 10 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 7 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆98Updated 2 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆62Updated 8 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
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆26Updated last year
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆16Updated 3 years ago
• jltsiren / bwt-merge
  A tool for merging large BWTs
  ☆26Updated 4 years ago
• tudocomp / tudocomp
  TU DOrtmund lossless COMPression framework
  ☆17Updated 4 months ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 3 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 4 months ago
• simongog / sdsl
  Succinct Data Structure Library
  ☆105Updated 11 years ago
• jltsiren / relative-fm
  Relative data structures based on the BWT
  ☆12Updated 6 years ago
• ekg / succinct-graph
  compressed, queryable variation graphs
  ☆11Updated 9 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 2 years ago
• drnatebrown / r-index-f
  R-Index-F Library for Pattern Matching
  ☆13Updated 5 months ago
• bingmann / cobs
  COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
  ☆83Updated last year
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• koeppl / stringsheet
  A cheatsheet for most common Stringology tasks
  ☆15Updated 3 years ago
• ot / succinct
  A collection of succinct data structures
  ☆198Updated last year
• kurpicz / saca-bench
  Collection of Suffix Array Construction Algorithms (SACAs)
  ☆28Updated 5 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated 2 years ago
• nicolaprezza / Re-Pair
  A space-efficient compressor based on the Re-Pair grammar
  ☆11Updated 7 years ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆48Updated 5 years ago
• waYne1337 / gsaca
  linear time suffix array construction algorithm
  ☆12Updated 8 years ago
• mpetri / recursive_graph_bisection
  This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…
  ☆10Updated 6 years ago