refresh-bio / RADULS

Related projects: ⓘ

• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆14Updated 3 years ago
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆26Updated last year
• itomomoti / OnlineRlbwt
  Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.
  ☆14Updated 6 years ago
• ips4o / ips2ra
  In-place Parallel Super Scalar Radix Sort (IPS²Ra)
  ☆29Updated 6 months ago
• jltsiren / bwt-merge
  A tool for merging large BWTs
  ☆26Updated 3 years ago
• koeppl / stringsheet
  A cheatsheet for most common Stringology tasks
  ☆15Updated 3 years ago
• drnatebrown / r-index-f
  R-Index-F Library for Pattern Matching
  ☆13Updated last month
• nicolaprezza / r-index
  An optimal space run-length Burrows-Wheeler transform full-text index
  ☆57Updated last year
• nicolaprezza / Re-Pair
  A space-efficient compressor based on the Re-Pair grammar
  ☆11Updated 7 years ago
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆83Updated last week
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆111Updated 4 months ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆48Updated 3 years ago
• nicolaprezza / BWTIL
  BWT Text Indexing Library: a set of tools to work with BWT-based text indexes
  ☆25Updated 2 years ago
• jltsiren / relative-fm
  Relative data structures based on the BWT
  ☆12Updated 6 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 7 years ago
• gmarcais / compact_vector
  Bit packed vector of integral values
  ☆25Updated last year
• voutcn / kxsort
  Fast in-place radix sort with STL-like API
  ☆44Updated 7 years ago
• mpetri / FM-Index
  FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…
  ☆99Updated 9 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆40Updated 2 weeks ago
• tudocomp / tudocomp
  TU DOrtmund lossless COMPression framework
  ☆17Updated last week
• ekg / mmmulti
  memory mapped multimap, multiset, and implicit interval tree based on an in-place parallel sort
  ☆27Updated 3 years ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆48Updated 5 years ago
• sacabench / sacabench
  Implementation of the sacabench framework
  ☆15Updated 3 years ago
• ByteHamster / SicHash
  A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.
  ☆14Updated last week
• tobc / dartminhash
  DartMinHash: Fast Sketching for Weighted Sets
  ☆13Updated 3 years ago
• cartoonist / kseqpp
  Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)
  ☆44Updated 6 months ago
• ddiazdom / grlBWT
  Efficient construction of the BWT using string compression
  ☆16Updated 2 months ago
• davidecenzato / PFP-eBWT
  Implementation of eBWT using Prefix-free parse (PFP)
  ☆12Updated last month
• jermp / lphash
  Fast and compact locality-preserving minimal perfect hashing for k-mer sets.
  ☆42Updated 10 months ago
• ekg / succinct-graph
  compressed, queryable variation graphs
  ☆11Updated 9 years ago