Alternatives and similar repositories for sketch:

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

• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆92Updated 4 months ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 3 years ago
• bingmann / cobs
  COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
  ☆83Updated 11 months ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆48Updated 5 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 9 years ago
• splatlab / mantis
  Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index
  ☆81Updated 10 months ago
• jermp / sshash
  A compressed, associative, exact, and weighted dictionary for k-mers.
  ☆86Updated 3 months ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 4 months ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated 7 months ago
• jltsiren / bwt-merge
  A tool for merging large BWTs
  ☆26Updated 4 years ago
• splatlab / cqf
  A General-Purpose Counting Filter: Counting Quotient Filter
  ☆127Updated last year
• jltsiren / relative-fm
  Relative data structures based on the BWT
  ☆12Updated 6 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆62Updated 7 months ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 2 years ago
• fclaude / libcds
  Compact Data Structures Library
  ☆124Updated 10 years ago
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆253Updated last year
• nicolaprezza / r-index
  An optimal space run-length Burrows-Wheeler transform full-text index
  ☆61Updated last year
• Intel-HLS / TileDB
  TileDB
  ☆79Updated last year
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆26Updated last year
• ekg / succinct-graph
  compressed, queryable variation graphs
  ☆11Updated 9 years ago
• oertl / probminhash
  ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity
  ☆42Updated 4 years ago
• simongog / sdsl
  Succinct Data Structure Library
  ☆105Updated 11 years ago
• oertl / hyperloglog-sketch-estimation-paper
  Paper about the estimation of cardinalities from HyperLogLog sketches
  ☆61Updated 3 years ago
• jltsiren / gcsa2
  BWT-based index for graphs
  ☆71Updated 2 months ago
• oertl / bagminhash
  BagMinHash - Minwise Hashing Algorithm for Weighted Sets
  ☆26Updated 4 years ago
• GuillaumeHolley / BloomFilterTrie
  An alignment-free, reference-free and incremental data structure for colored de Bruijn graph with application to pan-genome indexing.
  ☆43Updated 2 years ago
• jlabeit / parallel-divsufsort
  Parallel Lightweight Suffix Array Algorithm.
  ☆17Updated 8 years ago
• nicolaprezza / BWTIL
  BWT Text Indexing Library: a set of tools to work with BWT-based text indexes
  ☆25Updated 2 years ago
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆35Updated 2 years ago
• felipelouza / gsa-is
  Inducing enhanced suffix arrays for string collections [DCC'16, TCS 2017]
  ☆25Updated last year