hermanstehouwer / Enhanced-Suffix-ArraysLinks
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
Alternatives and similar repositories for Enhanced-Suffix-Arrays
Users that are interested in Enhanced-Suffix-Arrays are comparing it to the libraries listed below
Sorting:
- A framework for building reranking models.☆28Updated 10 years ago
- Reduced on-disk Suffix Array☆21Updated 11 years ago
- Feed-forward Bloom filters☆52Updated 14 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- Format-incompatible 64-bit version of cdb (no 4GB limit)☆14Updated 11 years ago
- A flexible tree-based index structure to support edit distance search on strings☆11Updated 7 years ago
- My personal C++ framework :^)☆43Updated 3 months ago
- Provide an idiomatic C++ interface to CPython's C API.☆27Updated 7 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 5 years ago
- Orly™ Graph Database☆39Updated last year
- M:N fiber implementation, with transparent IO reactor and timeouts, POSIX like APIs.☆16Updated 13 years ago
- C Library of Double-Array Trie System☆16Updated 11 years ago
- finding set bits in large bitmaps☆15Updated 9 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 5 years ago
- ☆10Updated 8 years ago
- ☆11Updated 8 years ago
- A high performance search engine☆107Updated 8 years ago
- An Implementation of Two-Trie and Tail-Trie using Double Array☆21Updated 12 years ago
- Library containing high-performance datastructures and utilities for C++☆74Updated 8 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- A collection of generic, C++ Bloom Filter classes developed for the Boost C++ Libraries.☆24Updated 8 years ago
- C++11 library for fast fuzzy searching☆14Updated 10 years ago
- A very fast and small(memory efficient) hash map☆7Updated 9 years ago
- Low-Level Data Structure - efficient data structures, and fast data access in the 3.x/4.x/5.x/6.x kernel☆120Updated 2 years ago
- ☆26Updated 8 years ago
- google all pairs similarity search package, with swig bindings☆22Updated 10 years ago
- a c89 compiler, need total test.☆29Updated 7 years ago
- A system for maintaining replicated state machines☆115Updated 8 years ago
- A Variable-Length String Hashing Library in C++☆44Updated 6 years ago
- MDBM a very fast memory-mapped key/value store.☆77Updated 2 years ago