schmidda / ukkonen-suffixtreeLinks
A C implementation of Ukkonen's suffix tree-building algorithm, with test suite and tree print.
☆22Updated 11 years ago
Alternatives and similar repositories for ukkonen-suffixtree
Users that are interested in ukkonen-suffixtree are comparing it to the libraries listed below
Sorting:
- A simple bitset library in C☆144Updated last month
- Generic SIMD intrinsic to allow for portable SIMD intrinsic programming☆42Updated 11 years ago
- Fast generalized heap tree algorithms in C++ and C. Provides simultaneous support for D-heap and B-heap.☆136Updated 6 years ago
- Lock-free multithreaded memory allocation☆110Updated 9 years ago
- A minimal modern LZ compressor example☆61Updated 5 years ago
- Generates benchmark data for two different data structures, then renders some graphs.☆112Updated 6 years ago
- Static Radix Tree (Patricia trie) implementation in C☆48Updated 8 years ago
- A tweaked version of Aha! ("A Hacker's Assistant") the superoptimiser by Henry S. Warren☆58Updated 3 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆121Updated 8 years ago
- 📶 A lock- and wait-free hashtable (and an array too)☆109Updated 3 weeks ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆66Updated last year
- Compact Data Structures Library☆103Updated 3 years ago
- Benchmark showing the we can randomly hash strings very quickly with good universality☆139Updated last year
- A hash table implementation using Robin Hood Linear Probing☆52Updated 11 years ago
- C11 Lock-free Stack☆184Updated last year
- A random number generator which outputs a unique 32-bit integer each time it's called.☆120Updated 10 years ago
- A benchmark of some prominent C/C++ hash table implementations☆104Updated 6 years ago
- C bit array structs and methods☆216Updated 3 years ago
- Variant on Wang Yi's wyhash with 32-bit output, using at most 64-bit math☆26Updated 6 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 5 years ago
- Vectorized version of the PCG random number generator☆87Updated last month
- Free-List Memory Pool of fixed-size objects in C99☆50Updated 2 years ago
- Fast and Reliable (but not Secure) Hash☆56Updated 7 years ago
- Base64 coding and decoding with SIMD instructions (SSE/AVX2/AVX512F/AVX512BW/AVX512VBMI/ARM Neon)☆170Updated 11 months ago
- Experiments with array layouts for comparison-based searching☆86Updated 2 years ago
- A portable in-place bitwise binary Fredkin trie algorithm which allows for near constant time insertions, deletions, finds, closest fit f…☆275Updated 4 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- Fast Hash Functions Using AES Intrinsics☆85Updated 6 years ago
- generate perfect hashes (alpha)☆79Updated 3 years ago
- A benchmark for sorting algorithms☆63Updated 4 years ago