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
• 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
  ☆26Updated 4 years ago
• 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 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆111Updated last year
• ips4o / ips2ra
  In-place Parallel Super Scalar Radix Sort (IPS²Ra)
  ☆34Updated 8 months ago
• jermp / sshash
  📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.
  ☆89Updated this week
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆16Updated 4 years ago
• Martinsos / opal
  SIMD C/C++ library for massive optimal sequence alignment (local/SW, infix, overlap, global)
  ☆39Updated last year
• nh13 / pbgzip
  Parallel Block GZIP
  ☆50Updated 9 years ago
• nicolaprezza / r-index
  An optimal space run-length Burrows-Wheeler transform full-text index
  ☆66Updated 2 years ago
• dnbaker / sketch
  C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
  ☆154Updated last year
• 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
• davidecenzato / PFP-eBWT
  Implementation of eBWT using Prefix-free parse (PFP)
  ☆14Updated 2 months ago
• gmarcais / compact_vector
  Bit packed vector of integral values
  ☆27Updated 7 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
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆64Updated last year
• Piezoid / pugz
  Truly parallel gzip decompression
  ☆124Updated 6 years ago
• splatlab / mantis
  Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index
  ☆82Updated last year
• ekg / succinct-graph
  compressed, queryable variation graphs
  ☆11Updated 10 years ago
• felipelouza / gsufsort
  gsufsort: building suffix arrays, LCP-arrays and BWTs for string collections [AMB 2020]
  ☆28Updated 7 months ago
• y-256 / libdivsufsort
  A lightweight suffix-sorting library
  ☆391Updated 5 years ago
• lh3 / cgranges
  A C/C++ library for fast interval overlap queries (with a "bedtools coverage" example)
  ☆168Updated last year
• cartoonist / kseqpp
  Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)
  ☆51Updated last year
• 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 3 months ago
• bcgsc / btl_bloomfilter
  The BTL C/C++ Common bloom filters for bioinformatics projects, as well as any APIs created for other programming languages.
  ☆18Updated 3 years ago
• jltsiren / gcsa2
  BWT-based index for graphs
  ☆72Updated 6 months ago