rossanoventurini / qwt

Related projects ⓘ

Alternatives and complementary repositories for qwt

• vigna / sux-rs
  Rust implementations of succinct data structures
  ☆47Updated this week
• kampersanda / sucds
  Collection of succinct data structures in Rust
  ☆81Updated 10 months ago
• jltsiren / simple-sds
  Simple succinct data structures (in Rust)
  ☆47Updated 5 months ago
• Daniel-Liu-c0deb0t / simple-saca
  Hardware go brrr bounded context suffix array construction algorithm
  ☆17Updated last year
• RagnarGrootKoerkamp / PTRHash
  PTRHash minimal perfect hash function, based of PTHash
  ☆33Updated 3 months ago
• lakwet / voracious_sort
  Voracious radix sort
  ☆65Updated 11 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
  ☆126Updated last month
• 10XGenomics / rust-boomphf
  Fast and scalable minimal perfect hashing for massive key sets
  ☆137Updated 4 months ago
• tov / succinct-rs
  Succinct Data Structures for Rust
  ☆56Updated 10 months ago
• 10XGenomics / rust-shardio
  Out-of-memory sorting of large datasets map / reduce style processing
  ☆47Updated 2 months ago
• Daniel-Liu-c0deb0t / cute-nucleotides
  Cute tricks for SIMD vectorized binary encoding and decoding of nucleotides, in Rust.
  ☆116Updated 3 years ago
• Cydhra / vers
  Succinct data structures using very efficient rank and select
  ☆62Updated 2 months ago
• Daniel-Liu-c0deb0t / triple_accel
  Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance cal…
  ☆105Updated last year
• pasta-toolbox / bit_vector
  Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.
  ☆26Updated last week
• CarlKCarlK / range-set-blaze
  Integer sets as fast, sorted, integer ranges with full set operations
  ☆78Updated last week
• jermp / sshash
  A compressed, associative, exact, and weighted dictionary for k-mers.
  ☆84Updated last month
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 2 years ago
• dcjones / coitrees
  A very fast interval tree data structure
  ☆111Updated 5 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
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 3 years ago
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆31Updated last year
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 2 months ago
• bingmann / cobs
  COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
  ☆83Updated 10 months ago
• anp / parasailors
  Rust bindings to parasail, a SIMD-accelerated pairwise sequence alignment library.
  ☆21Updated 8 years ago
• sstadick / rust-lapper
  Rust implementation of a fast, easy, interval tree library nim-lapper
  ☆56Updated 7 months ago
• jeffrey-xiao / probabilistic-collections-rs
  ☆15Updated last year
• andreacorbellini / rust-atomic-write-file
  ☆22Updated 3 weeks ago
• fasterthanlime / stringsearch
  Collection of techniques for (binary) string searching
  ☆21Updated 5 years ago
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆26Updated last year