Alternatives and similar repositories for libdivsufsort

Users that are interested in libdivsufsort are comparing it to the libraries listed below

• felipelouza / gsa-is
  Inducing enhanced suffix arrays for string collections [DCC'16, TCS 2017]
  ☆26Updated 3 weeks ago
• nicolaprezza / Re-Pair
  A space-efficient compressor based on the Re-Pair grammar
  ☆10Updated 8 years ago
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆16Updated 4 years ago
• jamshed / CaPS-SA
  Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays
  ☆17Updated 6 months ago
• felipelouza / gsufsort
  gsufsort: building suffix arrays, LCP-arrays and BWTs for string collections [AMB 2020]
  ☆27Updated 10 months ago
• koeppl / stringsheet
  A cheatsheet for most common Stringology tasks
  ☆14Updated 4 years ago
• IlyaGrebnov / libsais
  The libsais library provides fast linear-time construction of suffix array (SA), generalized suffix array (GSA), longest common prefix (L…
  ☆232Updated 3 months ago
• nicolaprezza / r-index
  An optimal space run-length Burrows-Wheeler transform full-text index
  ☆66Updated 2 years ago
• cartoonist / kseqpp
  Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)
  ☆56Updated last year
• drnatebrown / r-index-f
  R-Index-F Library for Pattern Matching
  ☆12Updated last year
• davidecenzato / PFP-eBWT
  Implementation of eBWT using Prefix-free parse (PFP)
  ☆14Updated 5 months ago
• jltsiren / bwt-merge
  A tool for merging large BWTs
  ☆24Updated 5 years ago
• bingmann / cobs
  COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
  ☆88Updated last year
• y-256 / libdivsufsort
  A lightweight suffix-sorting library
  ☆398Updated 5 years ago
• itomomoti / OnlineRlbwt
  Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.
  ☆14Updated 7 years ago
• ddiazdom / grlBWT
  Efficient construction of the BWT using string compression
  ☆20Updated 6 months ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated last week
• jermp / sshash
  📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.
  ☆90Updated last week
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆100Updated 2 weeks ago
• jltsiren / simple-sds
  Simple succinct data structures (in Rust)
  ☆53Updated this week
• jermp / lphash
  Fast and compact locality-preserving minimal perfect hashing for k-mer sets.
  ☆43Updated 2 years ago
• ekg / drawbwt
  vector illustrations of BWT based searching on small strings
  ☆16Updated 6 years ago
• Piezoid / pugz
  Truly parallel gzip decompression
  ☆124Updated 6 years ago
• rob-p / BooM
  A hash map using the BooPHF perfect hash function
  ☆13Updated 9 years ago
• vicLeva / bqf
  Implementation of a Backpack Quotient Filter
  ☆13Updated 5 months ago
• Martinsos / opal
  SIMD C/C++ library for massive optimal sequence alignment (local/SW, infix, overlap, global)
  ☆39Updated last year
• jlabeit / parallel-divsufsort
  Parallel Lightweight Suffix Array Algorithm.
  ☆18Updated 9 years ago
• mohsenzakeri / Movi
  Fast, Cache-Efficient, and Scalable Queries on Pangenomes
  ☆35Updated last month
• 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
• algbio / SBWT
  Code for the paper Succinct k-mer Set Representations Using Subset Rank Queries on the Spectral Burrows-Wheeler Transform (SBWT)
  ☆24Updated 9 months ago