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
  ☆142Updated 10 months ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆101Updated 3 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆121Updated 8 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆110Updated 9 years ago
• yosefk / heapprof
  A 250 LOC heap profiler - easy to hack/port, works out of the box with dynamically linked Linux binaries
  ☆49Updated 10 months ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆65Updated last year
• dryman / hash_bench
  Popular hash table implementation benchmarks
  ☆27Updated 8 years ago
• balena / radixdb
  Static Radix Tree (Patricia trie) implementation in C
  ☆48Updated 8 years ago
• noporpoise / BitArray
  C bit array structs and methods
  ☆214Updated 3 years ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 5 years ago
• wbhart / bsdnt
  BSD Licensed Bignum Library
  ☆232Updated last year
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆63Updated 4 years ago
• genericsimd / generic_simd
  Generic SIMD intrinsic to allow for portable SIMD intrinsic programming
  ☆41Updated 11 years ago
• ned14 / nedtries
  A portable in-place bitwise binary Fredkin trie algorithm which allows for near constant time insertions, deletions, finds, closest fit f…
  ☆276Updated 4 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆86Updated this week
• lemire / StronglyUniversalStringHashing
  Benchmark showing the we can randomly hash strings very quickly with good universality
  ☆139Updated 11 months ago
• lemire / rollinghashcpp
  Rolling Hash C++ Library
  ☆190Updated last year
• rantala / string-sorting
  A collection of string sorting algorithms
  ☆55Updated 3 years ago
• preshing / CompareIntegerMaps
  Generates benchmark data for two different data structures, then renders some graphs.
  ☆112Updated 6 years ago
• mackstann / hash-table-shootout
  A benchmark of some prominent C/C++ hash table implementations
  ☆105Updated 6 years ago
• chaelim / HAMT
  Hash Array Mapped Trie (C++ Templates)
  ☆125Updated 2 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆18Updated 7 years ago
• fclaude / libcds
  Compact Data Structures Library
  ☆129Updated 11 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆31Updated 3 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆55Updated 5 years ago
• eloraiby / rl-json-parser
  Ragel/Lemon based json-parser
  ☆18Updated 7 years ago
• fbuihuu / libtree
  A library which implements a couple of famous binary search trees.
  ☆166Updated 3 years ago
• smilingthax / cttrie
  Compile-time TRIE based string matcher (C++11)
  ☆53Updated 6 years ago
• mettienne / tiered-vector
  Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…
  ☆50Updated last year