Alternatives and similar repositories for diagonalsw

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

• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆65Updated last year
• 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
• femto-dev / femto
  Sequence Indexing and Search
  ☆109Updated 4 months ago
• fclaude / libcds
  Compact Data Structures Library
  ☆128Updated 11 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆101Updated 3 years ago
• lemire / rollinghashcpp
  Rolling Hash C++ Library
  ☆189Updated last year
• pzemtsov / article-align-x86
  Source code for the article "A bug story: data alignment on x86"
  ☆17Updated 9 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆120Updated 8 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆110Updated 8 years ago
• pelotoncycle / bsort
  Extremely fast inplace radix sort
  ☆42Updated 5 years ago
• attractivechaos / sann
  Simply feedforward neural network
  ☆19Updated 9 years ago
• jaamesd / BucketCompressionTrick
  Cool trick to store 4 5-bit values in one 16-bit value.
  ☆285Updated 5 years ago
• bingmann / cobs
  COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
  ☆86Updated last year
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆55Updated 5 years ago
• simongog / sdsl
  Succinct Data Structure Library
  ☆107Updated 12 years ago
• InstLatx64 / AVX512_PopCnt
  AVX512 population count routines
  ☆23Updated 6 years ago
• lemire / programmingishard
  Long-term book project
  ☆34Updated 4 years ago
• mettienne / tiered-vector
  Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…
  ☆50Updated last year
• CMU-SAFARI / Shifted-Hamming-Distance
  Source code for the Shifted Hamming Distance (SHD) filtering mechanism for sequence alignment. Described in the Bioinformatics journal pa…
  ☆36Updated 5 years ago
• ExaScience / elprep-bench
  elPrep reimplementations in C++ and Java, only for benchmark comparisons
  ☆10Updated 2 years ago
• hnsl / librcd
  A library for Rapid {C|Concurrency|Correct} Development
  ☆34Updated 10 years ago
• mklarqvist / StormBitmaps
  Fast algorithms for computing XX^T for binary matrices
  ☆14Updated 6 years ago
• wangyi-fudan / wyHLL
  The dream accurate approximate set cardinality estimator based on 3-bit HyperLogLog. More accurate than Redis HyperLogLog.
  ☆55Updated 4 years ago
• hellige / ccs-cpp
  CCS in C++
  ☆26Updated 2 years ago
• mackstann / hash-table-shootout
  A benchmark of some prominent C/C++ hash table implementations
  ☆105Updated 6 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated last year
• molpopgen / libsequence
  libsequence: a C++ class library for evolutionary genetic analysis
  ☆53Updated 5 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• schmidda / ukkonen-suffixtree
  A C implementation of Ukkonen's suffix tree-building algorithm, with test suite and tree print.
  ☆21Updated 11 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 9 years ago