Alternatives and similar repositories for parallel-divsufsort

Users that are interested in parallel-divsufsort are comparing it to the libraries listed below

• bingmann / cobs
  COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
  ☆84Updated last year
• jltsiren / bwt-merge
  A tool for merging large BWTs
  ☆26Updated 4 years ago
• nh13 / pbgzip
  Parallel Block GZIP
  ☆50Updated 8 years ago
• felipelouza / gsa-is
  Inducing enhanced suffix arrays for string collections [DCC'16, TCS 2017]
  ☆26Updated 2 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
• jermp / sshash
  📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.
  ☆84Updated this week
• jltsiren / gcsa2
  BWT-based index for graphs
  ☆71Updated 2 months ago
• nicolaprezza / BWTIL
  BWT Text Indexing Library: a set of tools to work with BWT-based text indexes
  ☆25Updated 3 years ago
• ocxtal / dozeu
  SIMD-parallel BLAST X-drop DP on sequence graphs
  ☆25Updated last year
• felipelouza / gsufsort
  gsufsort: building suffix arrays, LCP-arrays and BWTs for string collections [AMB 2020]
  ☆27Updated 3 months ago
• jermp / lphash
  Fast and compact locality-preserving minimal perfect hashing for k-mer sets.
  ☆43Updated last year
• medvedevgroup / TwoPaCo
  A fast constructor of the compressed de Bruijn graph from many genomes
  ☆40Updated 4 months ago
• gmarcais / compact_vector
  Bit packed vector of integral values
  ☆27Updated 4 months ago
• Martinsos / opal
  SIMD C/C++ library for massive optimal sequence alignment (local/SW, infix, overlap, global)
  ☆38Updated last year
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆16Updated 4 years ago
• jltsiren / relative-fm
  Relative data structures based on the BWT
  ☆12Updated 7 years ago
• drnatebrown / r-index-f
  R-Index-F Library for Pattern Matching
  ☆13Updated 10 months ago
• cartoonist / kseqpp
  Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)
  ☆47Updated last year
• nicolaprezza / r-index
  An optimal space run-length Burrows-Wheeler transform full-text index
  ☆65Updated 2 years ago
• arun-sub / bwa-mem2
  Building upon BWA-MEM2, this repository includes performance improvements to the seeding and mate-rescue steps.
  ☆13Updated 3 years ago
• ddiazdom / grlBWT
  Efficient construction of the BWT using string compression
  ☆18Updated this week
• vgteam / gssw
  efficient alignment of strings to partially ordered string graphs
  ☆33Updated 3 years ago
• jts / dbgfm
  FM-index representation of a de Bruijn graph
  ☆27Updated 7 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
• cosmo-team / cosmo
  Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.
  ☆51Updated last year
• dominikkempa / fsais
  External memory suffix array construction using inducing
  ☆11Updated 4 years ago
• holtjma / msbwt
  A python toolkit for building and querying multi-string BWTs
  ☆27Updated 8 years ago
• splatlab / mantis
  Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index
  ☆81Updated last year
• ekg / mmmulti
  memory mapped multimap, multiset, and implicit interval tree based on an in-place parallel sort
  ☆27Updated 4 years ago
• rob-p / FQFeeder
  Self-contained, multi-threaded fasta/q parser
  ☆43Updated 8 months ago