eriksjolund / diagonalswLinks
C/C++ implementation of the Smith-Waterman algorithm by using SIMD operations (e.g SSE4.1)
☆23Updated 9 years ago
Alternatives and similar repositories for diagonalsw
Users that are interested in diagonalsw are comparing it to the libraries listed below
Sorting:
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆66Updated last year
- Compact Data Structures Library☆129Updated 11 years ago
- Compact Data Structures Library☆103Updated 3 years ago
- Succinct Data Structure Library☆109Updated 12 years ago
- Sequence Indexing and Search☆110Updated 7 months ago
- Fast algorithms for computing XX^T for binary matrices☆14Updated 6 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated 2 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆24Updated 5 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆157Updated last year
- A fast implementation for varbyte 32bit/64bit integer compression☆121Updated 8 years ago
- Lock-free multithreaded memory allocation☆110Updated 9 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆55Updated 6 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 7 years ago
- A collection of string sorting algorithms☆55Updated 4 years ago
- Rolling Hash C++ Library☆190Updated last year
- Dynamic succinct/compressed data structures☆114Updated last month
- C library to compute the Hamming weight of arrays☆51Updated 7 years ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆108Updated 11 years ago
- Cool trick to store 4 5-bit values in one 16-bit value.☆285Updated 5 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆88Updated 2 years ago
- Simply feedforward neural network☆19Updated 9 years ago
- A small DFA for under 16 states☆54Updated 7 years ago
- The dream accurate approximate set cardinality estimator based on 3-bit HyperLogLog. More accurate than Redis HyperLogLog.☆55Updated 4 years ago
- Relative data structures based on the BWT☆12Updated 7 years ago
- Bloom-filter based minimal perfect hash function library☆271Updated 6 months ago
- Vectorized intersections (research code)☆16Updated 9 years ago
- Extremely fast inplace radix sort☆43Updated 5 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆50Updated last year
- elPrep reimplementations in C++ and Java, only for benchmark comparisons☆10Updated 2 years ago