kevintownsend / bwt

Related projects: ⓘ

• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆52Updated 4 years ago
• tommyettinger / waterhash
  Variant on Wang Yi's wyhash with 32-bit output, using at most 64-bit math
  ☆25Updated 5 years ago
• vreverdy / bit-algorithms
  An exploratory implementation of bit overloads of the C++ standard algorithms
  ☆18Updated 3 years ago
• glinscott / linzip2
  A minimal modern LZ compressor example
  ☆58Updated 3 years ago
• rantala / string-sorting
  A collection of string sorting algorithms
  ☆50Updated 2 years ago
• loxxous / Behemoth-Rank-Coding
  Fast and Strong Burrows Wheeler Model
  ☆18Updated 5 years ago
• mklarqvist / StormBitmaps
  Fast algorithms for computing XX^T for binary matrices
  ☆14Updated 4 years ago
• lemire / simdprune
  Pruning elements in SIMD vectors (i.e., packing left elements)
  ☆58Updated 7 months ago
• lemire / pospopcnt_avx512
  benchmarking positional population count
  ☆11Updated 6 months ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 3 years ago
• loxxous / Jampack
  Experimental parallel compression algorithm
  ☆23Updated 6 years ago
• InstLatx64 / AVX512_PopCnt
  AVX512 population count routines
  ☆22Updated 5 years ago
• michaelmaniscalco / m99
  novel high throughput entropy encoder for BWT data
  ☆13Updated 2 years ago
• jermp / sshash
  A compressed, associative, exact, and weighted dictionary for k-mers.
  ☆83Updated 2 weeks ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆50Updated 10 years ago
• farruggia / bc-zip
  Bicriteria Data Compressor
  ☆14Updated 6 years ago
• nicola-gigante / bitvector
  A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …
  ☆21Updated 2 years ago
• michaelmaniscalco / msufsort
  msufsort parallel suffix array construction algorithm
  ☆28Updated 3 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆44Updated 4 years ago
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆14Updated 3 years ago
• noporpoise / carrays
  Algorithms that work on generic C arrays
  ☆10Updated 7 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆44Updated 5 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆75Updated 5 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
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆57Updated 3 years ago
• adrian17 / cpp-drop-merge-sort
  C++ reimplementation of https://github.com/emilk/drop-merge-sort
  ☆21Updated 2 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated last year
• ByteHamster / SicHash
  A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.
  ☆14Updated last week
• ademakov / RNG
  A simple state-of-the-art C++ random number generator
  ☆17Updated 6 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆31Updated 9 months ago