Alternatives and similar repositories for tudocomp

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

• itomomoti / OnlineRlbwt
  Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.
  ☆14Updated 7 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated last year
• koeppl / stringsheet
  A cheatsheet for most common Stringology tasks
  ☆14Updated 4 years ago
• nicolaprezza / r-index
  An optimal space run-length Burrows-Wheeler transform full-text index
  ☆65Updated 2 years ago
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆16Updated 4 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• mpetri / FM-Index
  FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…
  ☆107Updated 10 years ago
• sacabench / sacabench
  Implementation of the sacabench framework
  ☆18Updated 4 years ago
• davidecenzato / PFP-eBWT
  Implementation of eBWT using Prefix-free parse (PFP)
  ☆14Updated 4 months ago
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆99Updated last week
• stringologytimes / StringologyTimes
  Paper Collection for Stringologists
  ☆17Updated this week
• nicolaprezza / BWTIL
  BWT Text Indexing Library: a set of tools to work with BWT-based text indexes
  ☆25Updated 3 years ago
• drnatebrown / r-index-f
  R-Index-F Library for Pattern Matching
  ☆12Updated last year
• kurpicz / saca-bench
  Collection of Suffix Array Construction Algorithms (SACAs)
  ☆33Updated 6 years ago
• simongog / sdsl
  Succinct Data Structure Library
  ☆108Updated 12 years ago
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 3 years ago
• bingmann / cobs
  COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
  ☆87Updated last year
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆51Updated 6 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆65Updated last year
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated last year
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆48Updated 4 years ago
• iskana / PBWT-sec
  ☆14Updated 5 years ago
• felipelouza / gsa-is
  Inducing enhanced suffix arrays for string collections [DCC'16, TCS 2017]
  ☆26Updated 2 months ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆101Updated 3 years ago
• jermp / sshash
  📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.
  ☆89Updated this week
• jltsiren / bwt-merge
  A tool for merging large BWTs
  ☆25Updated 5 years ago
• ekg / drawbwt
  vector illustrations of BWT based searching on small strings
  ☆16Updated 6 years ago
• ByteHamster / SicHash
  A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.
  ☆20Updated 2 months ago
• dnbaker / sketch
  C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
  ☆155Updated last year
• jltsiren / relative-fm
  Relative data structures based on the BWT
  ☆12Updated 7 years ago