Alternatives and similar repositories for ukkonen-suffixtree

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

• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆107Updated 8 years ago
• lemire / cbitset
  A simple bitset library in C
  ☆135Updated 5 months ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆48Updated 6 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆64Updated last year
• balena / radixdb
  Static Radix Tree (Patricia trie) implementation in C
  ☆49Updated 8 years ago
• mulle-concurrent / mulle-concurrent
  📶 A lock- and wait-free hashtable (and an array too)
  ☆109Updated 3 months ago
• preshing / CompareIntegerMaps
  Generates benchmark data for two different data structures, then renders some graphs.
  ☆112Updated 5 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆80Updated 5 months ago
• wbhart / bsdnt
  BSD Licensed Bignum Library
  ☆233Updated last year
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• lemire / StronglyUniversalStringHashing
  Benchmark showing the we can randomly hash strings very quickly with good universality
  ☆137Updated 6 months ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆119Updated 8 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆101Updated 3 years ago
• rurban / Perfect-Hash
  generate perfect hashes (alpha)
  ☆77Updated 3 years ago
• maximecaron / SIMD-Based-Posting-lists
  Implementation of Alexander A. Stepanov inverted Index Compression algorithms
  ☆21Updated 9 years ago
• mackstann / hash-table-shootout
  A benchmark of some prominent C/C++ hash table implementations
  ☆105Updated 6 years ago
• matovitch / cosche
  A dependency-based coroutine scheduler
  ☆45Updated 8 years ago
• skeeto / lstack
  C11 Lock-free Stack
  ☆183Updated last year
• skarupke / sherwood_map
  A hash table implementation using Robin Hood Linear Probing
  ☆51Updated 11 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 11 years ago
• coriolanus / libhhash
  Automatically exported from code.google.com/p/libhhash
  ☆32Updated 9 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
• yosefk / heapprof
  A 250 LOC heap profiler - easy to hack/port, works out of the box with dynamically linked Linux binaries
  ☆50Updated 5 months ago
• ned14 / nedtries
  A portable in-place bitwise binary Fredkin trie algorithm which allows for near constant time insertions, deletions, finds, closest fit f…
  ☆275Updated 3 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 14 years ago
• dcjones / hat-trie
  An efficient trie implementation.
  ☆255Updated 4 years ago
• dibyendumajumdar / dmr_c
  dmr_C is a C parser and JIT compiler with LLVM, Eclipse OMR and NanoJIT backends
  ☆53Updated 5 years ago
• gpakosz / PackedArray
  Random access array of tightly packed unsigned integers
  ☆164Updated 3 years ago
• google-research / automemcpy
  ☆22Updated 3 years ago
• fbuihuu / libtree
  A library which implements a couple of famous binary search trees.
  ☆165Updated 3 years ago