Alternatives and similar repositories for faster-minuter

Users that are interested in faster-minuter are comparing it to the libraries listed below

• itomomoti / OnlineRlbwt
  Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.
  ☆14Updated 7 years ago
• davidecenzato / PFP-eBWT
  Implementation of eBWT using Prefix-free parse (PFP)
  ☆14Updated 4 months ago
• vicLeva / bqf
  Implementation of a Backpack Quotient Filter
  ☆13Updated 4 months ago
• nicolaprezza / r-index
  An optimal space run-length Burrows-Wheeler transform full-text index
  ☆65Updated 2 years ago
• jltsiren / bwt-merge
  A tool for merging large BWTs
  ☆25Updated 5 years ago
• drnatebrown / r-index-f
  R-Index-F Library for Pattern Matching
  ☆12Updated last year
• koeppl / stringsheet
  A cheatsheet for most common Stringology tasks
  ☆14Updated 4 years ago
• jamshed / CaPS-SA
  Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays
  ☆17Updated 5 months ago
• bingmann / cobs
  COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
  ☆87Updated last year
• tobc / dartminhash
  DartMinHash: Fast Sketching for Weighted Sets
  ☆12Updated 4 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated last year
• nicolaprezza / BWTIL
  BWT Text Indexing Library: a set of tools to work with BWT-based text indexes
  ☆25Updated 3 years ago
• ddiazdom / grlBWT
  Efficient construction of the BWT using string compression
  ☆20Updated 5 months ago
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆98Updated 3 months ago
• jermp / sshash
  📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.
  ☆89Updated last week
• refresh-bio / RADULS
  Ultra fast MSD radix sorter
  ☆10Updated 5 years ago
• gmarcais / compact_vector
  Bit packed vector of integral values
  ☆28Updated 10 months ago
• mohsenzakeri / Movi
  Fast, Cache-Efficient, and Scalable Queries on Pangenomes
  ☆34Updated 3 weeks ago
• nicolaprezza / Re-Pair
  A space-efficient compressor based on the Re-Pair grammar
  ☆10Updated 8 years ago
• felipelouza / gsa-is
  Inducing enhanced suffix arrays for string collections [DCC'16, TCS 2017]
  ☆26Updated last month
• ekg / mmmulti
  memory mapped multimap, multiset, and implicit interval tree based on an in-place parallel sort
  ☆26Updated 4 years ago
• jermp / lphash
  Fast and compact locality-preserving minimal perfect hashing for k-mer sets.
  ☆43Updated 2 years ago
• jltsiren / relative-fm
  Relative data structures based on the BWT
  ☆12Updated 7 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
• brc7 / DiversitySampling
  ☆10Updated 3 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• cartoonist / kseqpp
  Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)
  ☆54Updated last year
• kurpicz / libdivsufsort
  A lightweight suffix-sorting library enhanced with LCP construction
  ☆12Updated 5 years ago
• RUSH-LAB / RAMBO
  ☆20Updated 5 years ago
• COMBINE-lab / SkipPatch
  dynamic-updateable-index
  ☆11Updated 10 years ago