eriksjolund / diagonalswLinks
C/C++ implementation of the Smith-Waterman algorithm by using SIMD operations (e.g SSE4.1)
☆23Updated 8 years ago
Alternatives and similar repositories for diagonalsw
Users that are interested in diagonalsw are comparing it to the libraries listed below
Sorting:
- Fast algorithms for computing XX^T for binary matrices☆14Updated 5 years ago
- Benchmark and visualization of various compression algorithms☆23Updated 9 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated last year
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 5 years ago
- Simply feedforward neural network☆19Updated 8 years ago
- Compact Tree Representation☆16Updated 8 years ago
- ☆13Updated 6 years ago
- Compact Data Structures Library☆100Updated 2 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
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Compact Data Structures Library☆126Updated 10 years ago
- Quick experiment to see how expensive safety is in C, for research☆12Updated 6 years ago
- finding set bits in large bitmaps☆15Updated 9 years ago
- Vectorized intersections (research code)☆15Updated 8 years ago
- Relative data structures based on the BWT☆12Updated 7 years ago
- A platform for unified linear and relational algebra analytics, built on the Accumulo NoSQL database☆11Updated 3 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 5 years ago
- FM-index representation of a de Bruijn graph☆27Updated 7 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆84Updated last year
- Linear vs binary search benchmark☆40Updated 5 years ago
- Run-length compressed BWT with LZ77 sampled suffix array☆10Updated 3 years ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆107Updated 10 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 6 years ago
- Succinct Data Structure Library☆106Updated 11 years ago
- Miscellaneous utility code for c++ projects.☆18Updated 6 years ago
- Static Huffman coding☆10Updated 8 years ago
- External memory suffix array construction using inducing☆11Updated 4 years ago
- The dream accurate approximate set cardinality estimator based on 3-bit HyperLogLog. More accurate than Redis HyperLogLog.☆55Updated 4 years ago