atuljangra / Ukkonen-SuffixTree
A C++ implementation of a Generalized Suffix Tree using Ukkonen's algorithm
☆23Updated 8 years ago
Related projects: ⓘ
- A collection of string sorting algorithms☆50Updated 2 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆61Updated 3 months ago
- Compact Data Structures Library☆97Updated 2 years ago
- Fast Concurrent Memoization Map (fcmm) is an almost lock-free concurrent hashmap written in C++11 to be used for memoization in concurren…☆51Updated 6 years ago
- Relative data structures based on the BWT☆12Updated 6 years ago
- A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …☆21Updated 2 years ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆99Updated 9 years ago
- C++ implementation of FM Index data structure wrapped in Python☆13Updated last year
- FOundation of stXXl and thriLL☆14Updated 7 months ago
- C library to compute the Hamming weight of arrays☆44Updated 5 years ago
- Compact Tree Representation☆16Updated 7 years ago
- A locality-sensitive hashing library☆45Updated 10 years ago
- A benchmark of some prominent C/C++ hash table implementations☆103Updated 5 years ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆48Updated 5 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆40Updated 2 weeks ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 2 years ago
- ☆21Updated this week
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆83Updated 7 months ago
- Benchmark and visualization of various compression algorithms☆23Updated 8 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14Updated 6 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆52Updated 8 months ago
- Dynamic succinct/compressed data structures☆111Updated 4 months ago
- Ultra fast MSD radix sorter☆11Updated 4 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆55Updated last year
- A tool for merging large BWTs☆26Updated 3 years ago
- For details, see the blog post:☆31Updated 9 months ago
- Computes graph connectivity for large graphs☆11Updated 7 years ago
- Fast in-place radix sort with STL-like API☆44Updated 7 years ago
- An alignment-free, reference-free and incremental data structure for colored de Bruijn graph with application to pan-genome indexing.☆43Updated 2 years ago
- Wavelet tree based on a fixed block boosting technique☆14Updated 3 years ago