Alternatives and similar repositories for FM-Index:

Users that are interested in FM-Index are comparing it to the libraries listed below

• mpetri / FM-Index
  FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…
  ☆105Updated 10 years ago
• nicolaprezza / BWTIL
  BWT Text Indexing Library: a set of tools to work with BWT-based text indexes
  ☆25Updated 2 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆63Updated 10 months ago
• nicolaprezza / lz-rlbwt
  Run-length compressed BWT with LZ77 sampled suffix array
  ☆10Updated 2 years ago
• refresh-bio / RADULS
  Ultra fast MSD radix sorter
  ☆11Updated 4 years ago
• jltsiren / relative-fm
  Relative data structures based on the BWT
  ☆12Updated 6 years ago
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆16Updated 3 years ago
• gmarcais / compact_vector
  Bit packed vector of integral values
  ☆27Updated 2 months ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆49Updated 5 years ago
• stxxl / foxxll
  FOundation of stXXl and thriLL
  ☆14Updated last year
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 5 years ago
• bingmann / cobs
  COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
  ☆84Updated last year
• itomomoti / OnlineRlbwt
  Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.
  ☆15Updated 6 years ago
• molpopgen / libsequence
  libsequence: a C++ class library for evolutionary genetic analysis
  ☆53Updated 4 years ago
• jltsiren / bwt-merge
  A tool for merging large BWTs
  ☆26Updated 4 years ago
• ocxtal / rbread
  Header-only, gzread-like reader for gzip, bz2, and xz.
  ☆12Updated 6 years ago
• ekg / succinct-graph
  compressed, queryable variation graphs
  ☆11Updated 9 years ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 3 years ago
• jermp / lphash
  Fast and compact locality-preserving minimal perfect hashing for k-mer sets.
  ☆43Updated last year
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 6 months ago
• ekg / mmmulti
  memory mapped multimap, multiset, and implicit interval tree based on an in-place parallel sort
  ☆27Updated 4 years ago
• nicolaprezza / r-index
  An optimal space run-length Burrows-Wheeler transform full-text index
  ☆62Updated last year
• jermp / sshash
  A compressed, associative, exact, and weighted dictionary for k-mers.
  ☆84Updated 5 months ago
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆26Updated last year
• tobc / dartminhash
  DartMinHash: Fast Sketching for Weighted Sets
  ☆13Updated 4 years ago
• atuljangra / Ukkonen-SuffixTree
  A C++ implementation of a Generalized Suffix Tree using Ukkonen's algorithm
  ☆23Updated 8 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated 10 months ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 4 years ago
• lh3 / rmaxcut
  An experimental tool to find approximate max-cuts in a large graph
  ☆11Updated 3 years ago