Alternatives and similar repositories for faster-minuter

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

• vicLeva / bqf
  Implementation of a Backpack Quotient Filter
  ☆12Updated 2 months ago
• itomomoti / OnlineRlbwt
  Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.
  ☆15Updated 7 years ago
• davidecenzato / PFP-eBWT
  Implementation of eBWT using Prefix-free parse (PFP)
  ☆14Updated 2 months ago
• nicolaprezza / r-index
  An optimal space run-length Burrows-Wheeler transform full-text index
  ☆66Updated 2 years ago
• jltsiren / bwt-merge
  A tool for merging large BWTs
  ☆26Updated 4 years ago
• jamshed / CaPS-SA
  Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays
  ☆15Updated 2 months ago
• drnatebrown / r-index-f
  R-Index-F Library for Pattern Matching
  ☆13Updated last year
• koeppl / stringsheet
  A cheatsheet for most common Stringology tasks
  ☆15Updated 4 years ago
• ddiazdom / grlBWT
  Efficient construction of the BWT using string compression
  ☆20Updated 3 months ago
• bingmann / cobs
  COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
  ☆83Updated last year
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆111Updated last year
• nicolaprezza / BWTIL
  BWT Text Indexing Library: a set of tools to work with BWT-based text indexes
  ☆25Updated 3 years ago
• tobc / dartminhash
  DartMinHash: Fast Sketching for Weighted Sets
  ☆12Updated 4 years ago
• mohsenzakeri / Movi
  Fast and cache-efficient full-text pangenome index
  ☆29Updated this week
• felipelouza / gsa-is
  Inducing enhanced suffix arrays for string collections [DCC'16, TCS 2017]
  ☆26Updated 2 years ago
• refresh-bio / RADULS
  Ultra fast MSD radix sorter
  ☆11Updated 5 years ago
• nicolaprezza / Re-Pair
  A space-efficient compressor based on the Re-Pair grammar
  ☆11Updated 8 years ago
• gmarcais / compact_vector
  Bit packed vector of integral values
  ☆27Updated 7 months ago
• jermp / lphash
  Fast and compact locality-preserving minimal perfect hashing for k-mer sets.
  ☆43Updated last year
• RUSH-LAB / RAMBO
  ☆20Updated 5 years ago
• jltsiren / relative-fm
  Relative data structures based on the BWT
  ☆12Updated 7 years ago
• algbio / SBWT
  Code for the paper Succinct k-mer Set Representations Using Subset Rank Queries on the Spectral Burrows-Wheeler Transform (SBWT)
  ☆24Updated 6 months ago
• lh3 / rmaxcut
  An experimental tool to find approximate max-cuts in a large graph
  ☆10Updated 4 years ago
• jermp / sshash
  📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.
  ☆89Updated this week
• csirac / dynamicDBG
  Practical Dynamic de Bruijn Graphs
  ☆18Updated 4 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• COMBINE-lab / SkipPatch
  dynamic-updateable-index
  ☆11Updated 9 years ago
• rob-p / BooM
  A hash map using the BooPHF perfect hash function
  ☆13Updated 8 years ago
• cartoonist / kseqpp
  Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)
  ☆51Updated last year
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆95Updated last month