Alternatives and similar repositories for relative-fm:

Users that are interested in relative-fm are comparing it to the libraries listed below

• jltsiren / bwt-merge
  A tool for merging large BWTs
  ☆26Updated 4 years ago
• nicolaprezza / BWTIL
  BWT Text Indexing Library: a set of tools to work with BWT-based text indexes
  ☆25Updated 2 years ago
• jts / dbgfm
  FM-index representation of a de Bruijn graph
  ☆27Updated 7 years ago
• nicolaprezza / lz-rlbwt
  Run-length compressed BWT with LZ77 sampled suffix array
  ☆10Updated 2 years ago
• ekg / succinct-graph
  compressed, queryable variation graphs
  ☆11Updated 9 years ago
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆16Updated 3 years ago
• 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
• medvedevgroup / TwoPaCo
  A fast constructor of the compressed de Bruijn graph from many genomes
  ☆40Updated 2 years ago
• splatlab / mantis
  Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index
  ☆81Updated 10 months ago
• itomomoti / OnlineRlbwt
  Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.
  ☆15Updated 6 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 3 years ago
• RUSH-LAB / RAMBO
  ☆20Updated 4 years ago
• bingmann / cobs
  COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
  ☆83Updated last year
• txje / c-minhash
  Simple and fast MinHash implementation in C with Python wrapper
  ☆13Updated 4 years ago
• ekg / drawbwt
  vector illustrations of BWT based searching on small strings
  ☆16Updated 5 years ago
• jermp / lphash
  Fast and compact locality-preserving minimal perfect hashing for k-mer sets.
  ☆43Updated last year
• 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 11 years ago
• csirac / dynamicDBG
  Practical Dynamic de Bruijn Graphs
  ☆18Updated 4 years ago
• ekg / mmmulti
  memory mapped multimap, multiset, and implicit interval tree based on an in-place parallel sort
  ☆27Updated 4 years ago
• rob-p / BooM
  A hash map using the BooPHF perfect hash function
  ☆12Updated 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…
  ☆104Updated 10 years ago
• lh3 / rmaxcut
  An experimental tool to find approximate max-cuts in a large graph
  ☆11Updated 3 years ago
• cosmo-team / cosmo
  Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.
  ☆51Updated 10 months ago
• ocxtal / rbread
  Header-only, gzread-like reader for gzip, bz2, and xz.
  ☆12Updated 6 years ago
• vicLeva / bqf
  Implementation of a Backpack Quotient Filter
  ☆11Updated 6 months ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆62Updated 8 months ago
• gmarcais / compact_vector
  Bit packed vector of integral values
  ☆26Updated this week
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 7 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated 8 months ago