Alternatives and similar repositories for gsufsort

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

• felipelouza / gsa-is
  Inducing enhanced suffix arrays for string collections [DCC'16, TCS 2017]
  ☆26Updated 2 years ago
• alshai / Big-BWT
  modified from gitlab.com/manzai/Big-BWT to support fasta files
  ☆9Updated 3 months ago
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆16Updated 3 years ago
• drnatebrown / r-index-f
  R-Index-F Library for Pattern Matching
  ☆13Updated 9 months ago
• ocxtal / dozeu
  SIMD-parallel BLAST X-drop DP on sequence graphs
  ☆24Updated 11 months ago
• nicolaprezza / r-index
  An optimal space run-length Burrows-Wheeler transform full-text index
  ☆64Updated last year
• jltsiren / bwt-merge
  A tool for merging large BWTs
  ☆26Updated 4 years ago
• koeppl / stringsheet
  A cheatsheet for most common Stringology tasks
  ☆15Updated 4 years ago
• kurpicz / libdivsufsort
  A lightweight suffix-sorting library enhanced with LCP construction
  ☆11Updated 5 years ago
• cartoonist / kseqpp
  Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)
  ☆47Updated last year
• ddiazdom / grlBWT
  Efficient construction of the BWT using string compression
  ☆17Updated 6 months ago
• Kmer-File-Format / kff-tools
  ☆17Updated last year
• ekg / drawbwt
  vector illustrations of BWT based searching on small strings
  ☆16Updated 6 years ago
• lh3 / ropebwt2
  Incremental construction of FM-index for DNA sequences
  ☆70Updated 11 months ago
• nicolaprezza / BWTIL
  BWT Text Indexing Library: a set of tools to work with BWT-based text indexes
  ☆25Updated 3 years ago
• Martinsos / opal
  SIMD C/C++ library for massive optimal sequence alignment (local/SW, infix, overlap, global)
  ☆38Updated last year
• jeizenga / wfalm
  Refinements of the WFA alignment algorithm with better complexity
  ☆26Updated 3 years ago
• mohsenzakeri / Movi
  Fast and cache-efficient full-text pangenome index
  ☆27Updated last month
• vicLeva / bqf
  Implementation of a Backpack Quotient Filter
  ☆11Updated 9 months ago
• cosmo-team / cosmo
  Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.
  ☆51Updated last year
• lh3 / lv89
  C implementation of the Landau-Vishkin algorithm
  ☆35Updated 3 years ago
• lh3 / ksw2
  Global alignment and alignment extension
  ☆131Updated last year
• maxrossi91 / moni
  MONI: A Pangenomic Index for Finding MEMs
  ☆37Updated last month
• jermp / lphash
  Fast and compact locality-preserving minimal perfect hashing for k-mer sets.
  ☆43Updated last year
• algbio / themisto
  Space-efficient pseudoalignment with a colored de Bruijn graph
  ☆52Updated 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
• jamshed / CaPS-SA
  Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays
  ☆13Updated last month
• marco-oliva / pfp
  Prefix Free Parsing
  ☆8Updated last year
• medvedevgroup / TwoPaCo
  A fast constructor of the compressed de Bruijn graph from many genomes
  ☆40Updated 3 months ago
• nicolaprezza / Re-Pair
  A space-efficient compressor based on the Re-Pair grammar
  ☆11Updated 8 years ago