rossanoventurini / qwt

Related projects: ⓘ

• vigna / sux-rs
  Rust implementations of succinct data structures
  ☆43Updated this week
• jltsiren / simple-sds
  Simple succinct data structures (in Rust)
  ☆46Updated 3 months ago
• kampersanda / sucds
  Collection of succinct data structures in Rust
  ☆80Updated 7 months ago
• Daniel-Liu-c0deb0t / simple-saca
  Hardware go brrr bounded context suffix array construction algorithm
  ☆17Updated 10 months ago
• RagnarGrootKoerkamp / PTRHash
  PTRHash minimal perfect hash function, based of PTHash
  ☆33Updated last month
• tov / succinct-rs
  Succinct Data Structures for Rust
  ☆56Updated 8 months ago
• Daniel-Liu-c0deb0t / cute-nucleotides
  Cute tricks for SIMD vectorized binary encoding and decoding of nucleotides, in Rust.
  ☆116Updated 3 years ago
• lakwet / voracious_sort
  Voracious radix sort
  ☆60Updated 9 months ago
• sdsl-rs / sdsl-rs
  A Rust interface for the Succinct Data Structure Library.
  ☆14Updated 2 years ago
• beling / bsuccinct-rs
  Rust libraries and programs focused on succinct data structures
  ☆112Updated 3 weeks ago
• pasta-toolbox / bit_vector
  Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.
  ☆25Updated 2 weeks ago
• 10XGenomics / rust-shardio
  Out-of-memory sorting of large datasets map / reduce style processing
  ☆47Updated last week
• 10XGenomics / rust-boomphf
  Fast and scalable minimal perfect hashing for massive key sets
  ☆125Updated 2 months ago
• CarlKCarlK / range-set-blaze
  Integer sets as fast, sorted, integer ranges with full set operations
  ☆70Updated 2 weeks ago
• Cydhra / vers
  Succinct data structures using very efficient rank and select
  ☆58Updated last week
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆46Updated 2 years ago
• stringologytimes / StringologyTimes
  Collecting papers for stringologist.
  ☆14Updated 3 weeks ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆40Updated 2 weeks ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆48Updated 3 years ago
• jermp / sshash
  A compressed, associative, exact, and weighted dictionary for k-mers.
  ☆83Updated 2 weeks ago
• jeffrey-xiao / probabilistic-collections-rs
  ☆15Updated last year
• Daniel-Liu-c0deb0t / triple_accel
  Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance cal…
  ☆101Updated last year
• jean-pierreBoth / probminhash
  Rust implementation of probminhash, superminhash and hyperloglog sketching algorithms
  ☆22Updated 4 months ago
• koeppl / stringsheet
  A cheatsheet for most common Stringology tasks
  ☆15Updated 3 years ago
• vicLeva / bqf
  Implementation of a Backpack Quotient Filter
  ☆10Updated last month
• dcjones / coitrees
  A very fast interval tree data structure
  ☆110Updated 3 months ago
• sekineh / wavelet-matrix-rs
  Wavelet Matrix implementation written in Rust
  ☆13Updated 2 years ago
• sstadick / rust-lapper
  Rust implementation of a fast, easy, interval tree library nim-lapper
  ☆55Updated 5 months ago
• main-- / rust-intervaltree
  ☆19Updated 7 months ago
• samuell / gccontent-benchmark
  Benchmarking different languages for a simple bioinformatics task (Counting the GC fraction of DNA in a FASTA file)
  ☆57Updated last year