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)
  ☆83Updated last year
• nh13 / pbgzip
  Parallel Block GZIP
  ☆50Updated 9 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
• nicolaprezza / BWTIL
  BWT Text Indexing Library: a set of tools to work with BWT-based text indexes
  ☆25Updated 3 years ago
• jltsiren / bwt-merge
  A tool for merging large BWTs
  ☆25Updated 4 years ago
• jermp / sshash
  📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.
  ☆89Updated this week
• Piezoid / pugz
  Truly parallel gzip decompression
  ☆124Updated 6 years ago
• nicolaprezza / r-index
  An optimal space run-length Burrows-Wheeler transform full-text index
  ☆65Updated 2 years ago
• pelotoncycle / bsort
  Extremely fast inplace radix sort
  ☆42Updated 5 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆110Updated last year
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆95Updated last month
• felipelouza / gsa-is
  Inducing enhanced suffix arrays for string collections [DCC'16, TCS 2017]
  ☆26Updated 2 weeks ago
• Martinsos / opal
  SIMD C/C++ library for massive optimal sequence alignment (local/SW, infix, overlap, global)
  ☆39Updated last year
• ips4o / ips2ra
  In-place Parallel Super Scalar Radix Sort (IPS²Ra)
  ☆34Updated 9 months ago
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆16Updated 4 years ago
• jermp / lphash
  Fast and compact locality-preserving minimal perfect hashing for k-mer sets.
  ☆43Updated last year
• ddiazdom / grlBWT
  Efficient construction of the BWT using string compression
  ☆20Updated 4 months ago
• jltsiren / gcsa2
  BWT-based index for graphs
  ☆73Updated 7 months ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆64Updated last year
• y-256 / libdivsufsort
  A lightweight suffix-sorting library
  ☆393Updated 5 years ago
• lh3 / cgranges
  A C/C++ library for fast interval overlap queries (with a "bedtools coverage" example)
  ☆168Updated last year
• koeppl / stringsheet
  A cheatsheet for most common Stringology tasks
  ☆14Updated 4 years ago
• jts / dbgfm
  FM-index representation of a de Bruijn graph
  ☆27Updated 8 years ago
• dnbaker / sketch
  C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
  ☆154Updated last year
• ekg / mmmulti
  memory mapped multimap, multiset, and implicit interval tree based on an in-place parallel sort
  ☆26Updated 4 years ago
• davidecenzato / PFP-eBWT
  Implementation of eBWT using Prefix-free parse (PFP)
  ☆14Updated 3 months ago
• felipelouza / gsufsort
  gsufsort: building suffix arrays, LCP-arrays and BWTs for string collections [AMB 2020]
  ☆28Updated 8 months ago
• cartoonist / kseqpp
  Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)
  ☆53Updated last year
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆265Updated 3 months ago
• bcgsc / ntHash
  Fast hash function for DNA/RNA sequences
  ☆104Updated last year