Alternatives and similar repositories for sacak-lcp:

Users that are interested in sacak-lcp are comparing it to the libraries listed below

• felipelouza / egsa
  Generalized enhanced suffix array construction in external memory [CPM'13, AMB 2017]
  ☆15Updated 3 years ago
• itomomoti / OnlineRlbwt
  Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.
  ☆15Updated 6 years 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
• tudocomp / tudocomp
  TU DOrtmund lossless COMPression framework
  ☆17Updated 4 months ago
• kurpicz / saca-bench
  Collection of Suffix Array Construction Algorithms (SACAs)
  ☆27Updated 5 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 7 years ago
• felipelouza / gsa-is
  Inducing enhanced suffix arrays for string collections [DCC'16, TCS 2017]
  ☆25Updated last year
• sacabench / sacabench
  Implementation of the sacabench framework
  ☆15Updated 3 years ago
• jltsiren / relative-fm
  Relative data structures based on the BWT
  ☆12Updated 6 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
• vicLeva / bqf
  Implementation of a Backpack Quotient Filter
  ☆11Updated 5 months ago
• drnatebrown / r-index-f
  R-Index-F Library for Pattern Matching
  ☆13Updated 5 months ago
• elventear / sais-lite-lcp
  Induced Suffix Array with LCP construction (Mirror)
  ☆23Updated 12 years ago
• tobc / dartminhash
  DartMinHash: Fast Sketching for Weighted Sets
  ☆13Updated 3 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated 7 months ago
• nicolaprezza / Re-Pair
  A space-efficient compressor based on the Re-Pair grammar
  ☆11Updated 7 years ago
• felipelouza / gsufsort
  gsufsort: building suffix arrays, LCP-arrays and BWTs for string collections [AMB 2020]
  ☆26Updated last year
• COMBINE-lab / SkipPatch
  dynamic-updateable-index
  ☆11Updated 9 years ago
• nicolaprezza / r-index
  An optimal space run-length Burrows-Wheeler transform full-text index
  ☆61Updated last year
• koeppl / stringsheet
  A cheatsheet for most common Stringology tasks
  ☆15Updated 3 years ago
• waYne1337 / gsaca
  linear time suffix array construction algorithm
  ☆12Updated 8 years ago
• 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
• nicolaprezza / lz-rlbwt
  Run-length compressed BWT with LZ77 sampled suffix array
  ☆10Updated 2 years ago
• kampersanda / dyft
  C++17 Implementation of Dynamic Filter Trie
  ☆8Updated 3 years ago
• ekg / drawbwt
  vector illustrations of BWT based searching on small strings
  ☆16Updated 5 years ago
• stringologytimes / StringologyTimes
  Paper Collection for Stringologists
  ☆16Updated 2 months ago
• xxsds / multi_index
  A C++ template library for compact Hamming distance indexes
  ☆10Updated 7 years ago
• jlabeit / parallel-divsufsort
  Parallel Lightweight Suffix Array Algorithm.
  ☆17Updated 8 years ago