Alternatives and similar repositories for BWTIL

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

• dominikkempa / fsais
  External memory suffix array construction using inducing
  ☆11Updated 4 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated last year
• bingmann / cobs
  COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
  ☆84Updated last year
• itomomoti / OnlineRlbwt
  Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.
  ☆15Updated 7 years ago
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆16Updated 4 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆64Updated last year
• nicolaprezza / lz-rlbwt
  Run-length compressed BWT with LZ77 sampled suffix array
  ☆10Updated 3 years ago
• jltsiren / relative-fm
  Relative data structures based on the BWT
  ☆12Updated 7 years ago
• jltsiren / bwt-merge
  A tool for merging large BWTs
  ☆26Updated 4 years ago
• nicolaprezza / r-index
  An optimal space run-length Burrows-Wheeler transform full-text index
  ☆65Updated 2 years ago
• ekg / succinct-graph
  compressed, queryable variation graphs
  ☆11Updated 10 years ago
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆94Updated 2 months ago
• gmarcais / compact_vector
  Bit packed vector of integral values
  ☆27Updated 5 months ago
• jermp / sshash
  📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.
  ☆88Updated this week
• 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
• fclaude / libcds
  Compact Data Structures Library
  ☆126Updated 10 years ago
• simongog / sdsl
  Succinct Data Structure Library
  ☆106Updated 11 years ago
• tudocomp / tudocomp
  TU DOrtmund lossless COMPression framework
  ☆19Updated 10 months ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆100Updated 3 years ago
• drnatebrown / r-index-f
  R-Index-F Library for Pattern Matching
  ☆13Updated 11 months ago
• 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
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• davidecenzato / PFP-eBWT
  Implementation of eBWT using Prefix-free parse (PFP)
  ☆14Updated 10 months ago
• felipelouza / gsufsort
  gsufsort: building suffix arrays, LCP-arrays and BWTs for string collections [AMB 2020]
  ☆27Updated 4 months ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 3 years ago
• noporpoise / jelly-hash
  Low memory multithreaded hash table
  ☆24Updated 10 years ago
• ocxtal / rbread
  Header-only, gzread-like reader for gzip, bz2, and xz.
  ☆12Updated 6 years 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
• jlabeit / parallel-divsufsort
  Parallel Lightweight Suffix Array Algorithm.
  ☆18Updated 8 years ago