hermanstehouwer / Enhanced-Suffix-Arrays
A flexible implementation of enhanced suffix arrays in template based C++. Supports single and multi-position wildcard. Fast queries thanks to the implicit suffix tree structure.
☆20Updated 4 years ago
Related projects ⓘ
Alternatives and complementary repositories for Enhanced-Suffix-Arrays
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆53Updated 10 months ago
- Fast implementations of the scancount algorithm: C++ header-only library☆25Updated 5 years ago
- Reduced on-disk Suffix Array☆21Updated 11 years ago
- finding set bits in large bitmaps☆15Updated 8 years ago
- A comparison between different integer set techniques☆14Updated 6 years ago
- Implementation of Alexander A. Stepanov inverted Index Compression algorithms☆21Updated 9 years ago
- Wren: Nonblocking Reads in a Partitioned Transactional Causally Consistent Data Store☆8Updated 6 years ago
- A framework for building reranking models.☆29Updated 9 years ago
- ☆25Updated 7 years ago
- Feed-forward Bloom filters☆52Updated 13 years ago
- ☆11Updated 6 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 4 years ago
- ☆13Updated 6 years ago
- FOundation of stXXl and thriLL☆14Updated 10 months ago
- A copy of the code used to demonstrate implementing a DSL at a talk given at FOSDEM2012☆16Updated 11 years ago
- ☆10Updated 7 years ago
- Algorithms to compress sorted arrays of integers☆18Updated 10 years ago
- Provide an idiomatic C++ interface to CPython's C API.☆27Updated 7 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆55Updated last year
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆50Updated 9 months ago
- A collection of generic, C++ Bloom Filter classes developed for the Boost C++ Libraries.☆23Updated 7 years ago
- A dependency-based coroutine scheduler☆46Updated 8 years ago
- A Variable-Length String Hashing Library in C++☆43Updated 5 years ago
- similarity join and search algorithms for edit distance and jaccard☆18Updated 6 years ago
- An Implementation of Two-Trie and Tail-Trie using Double Array☆21Updated 11 years ago
- C Library of Double-Array Trie System☆16Updated 11 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 6 years ago
- Vectorized intersections (research code)☆14Updated 7 years ago
- Roaring bitmaps in C☆16Updated 8 years ago
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 13 years ago