Alternatives and similar repositories for ukkonen-suffixtree

Users that are interested in ukkonen-suffixtree are comparing it to the libraries listed below

• lemire / cbitset
  A simple bitset library in C
  ☆144Updated last month
• preshing / CompareIntegerMaps
  Generates benchmark data for two different data structures, then renders some graphs.
  ☆112Updated 6 years ago
• mulle-concurrent / mulle-concurrent
  📶 A lock- and wait-free hashtable (and an array too)
  ☆109Updated 3 weeks ago
• yosefk / heapprof
  A 250 LOC heap profiler - easy to hack/port, works out of the box with dynamically linked Linux binaries
  ☆49Updated 11 months ago
• leni536 / fast_hilbert_curve
  Fast caclulation of the coordinates of the nth point of the Hilbert curve
  ☆16Updated 7 years ago
• google-research / automemcpy
  ☆22Updated 3 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆110Updated 9 years ago
• dryman / hash_bench
  Popular hash table implementation benchmarks
  ☆27Updated 8 years ago
• kobalicek / mpsl
  Shader-Like Mathematical Expression JIT Engine for C++ Language
  ☆60Updated 6 years ago
• genericsimd / generic_simd
  Generic SIMD intrinsic to allow for portable SIMD intrinsic programming
  ☆42Updated 12 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆121Updated 8 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆87Updated last month
• noporpoise / BitArray
  C bit array structs and methods
  ☆216Updated 3 years ago
• dpt / Aha
  A tweaked version of Aha! ("A Hacker's Assistant") the superoptimiser by Henry S. Warren
  ☆58Updated 3 years ago
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆52Updated 11 years ago
• djoldman / fmpool
  Free-List Memory Pool of fixed-size objects in C99
  ☆50Updated 2 years ago
• eloraiby / rl-json-parser
  Ragel/Lemon based json-parser
  ☆18Updated 7 years ago
• balena / radixdb
  Static Radix Tree (Patricia trie) implementation in C
  ☆48Updated 8 years ago
• wbhart / bsdnt
  BSD Licensed Bignum Library
  ☆233Updated last year
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆66Updated last year
• PublicScan / TinyC
  A just-in-time compiler for c minus
  ☆46Updated 12 years ago
• chaelim / HAMT
  Hash Array Mapped Trie (C++ Templates)
  ☆125Updated 2 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆51Updated 7 years ago
• LiveAsynchronousVisualizedArchitecture / lava
  Live Asynchronous Visualized Architecture
  ☆98Updated 6 years ago
• matovitch / cosche
  A dependency-based coroutine scheduler
  ☆45Updated 9 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆58Updated 3 years ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 5 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆103Updated 3 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆55Updated 6 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆18Updated 7 years ago