Alternatives and similar repositories for FM-Index

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

• nicolaprezza / BWTIL
  BWT Text Indexing Library: a set of tools to work with BWT-based text indexes
  ☆25Updated 3 years ago
• dominikkempa / fsais
  External memory suffix array construction using inducing
  ☆11Updated 4 years ago
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆16Updated 4 years ago
• jltsiren / bwt-merge
  A tool for merging large BWTs
  ☆26Updated 4 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
• itomomoti / OnlineRlbwt
  Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.
  ☆15Updated 7 years ago
• stxxl / foxxll
  FOundation of stXXl and thriLL
  ☆14Updated last year
• jltsiren / relative-fm
  Relative data structures based on the BWT
  ☆12Updated 7 years ago
• bingmann / cobs
  COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
  ☆84Updated last year
• nicolaprezza / lz-rlbwt
  Run-length compressed BWT with LZ77 sampled suffix array
  ☆10Updated 3 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆64Updated last year
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆49Updated 5 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• jts / dbgfm
  FM-index representation of a de Bruijn graph
  ☆27Updated 7 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated last year
• refresh-bio / RADULS
  Ultra fast MSD radix sorter
  ☆11Updated 5 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 9 months ago
• ekg / mmmulti
  memory mapped multimap, multiset, and implicit interval tree based on an in-place parallel sort
  ☆27Updated 4 years ago
• ekg / succinct-graph
  compressed, queryable variation graphs
  ☆11Updated 10 years ago
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆94Updated 2 months ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆100Updated 3 years ago
• GuillaumeHolley / BloomFilterTrie
  An alignment-free, reference-free and incremental data structure for colored de Bruijn graph with application to pan-genome indexing.
  ☆44Updated 3 years ago
• GuillaumeHolley / BlastGraph
  BlastGraph is a new tool for computing intensive approximate pattern matching in a sequence graph or a de-Bruijn graph. Given an oriented…
  ☆12Updated 12 years ago
• gmarcais / compact_vector
  Bit packed vector of integral values
  ☆27Updated 5 months ago
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 2 years ago
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆26Updated 2 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• nicolaprezza / r-index
  An optimal space run-length Burrows-Wheeler transform full-text index
  ☆65Updated 2 years ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 5 years ago