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
  ☆134Updated 3 months ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆60Updated 4 years ago
• preshing / CompareIntegerMaps
  Generates benchmark data for two different data structures, then renders some graphs.
  ☆112Updated 5 years ago
• eloraiby / rl-json-parser
  Ragel/Lemon based json-parser
  ☆17Updated 6 years ago
• suiginsoft / hebimath
  arbitrary precision arithmetic library
  ☆43Updated 6 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆77Updated 3 months ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆29Updated 2 years ago
• coriolanus / libhhash
  Automatically exported from code.google.com/p/libhhash
  ☆32Updated 9 years ago
• sysprog21 / mapreduce
  A simple C Thread pool implementation
  ☆13Updated 5 years ago
• yosefk / heapprof
  A 250 LOC heap profiler - easy to hack/port, works out of the box with dynamically linked Linux binaries
  ☆50Updated 2 months ago
• balena / radixdb
  Static Radix Tree (Patricia trie) implementation in C
  ☆50Updated 8 years ago
• wbhart / bsdnt
  BSD Licensed Bignum Library
  ☆233Updated last year
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 5 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆63Updated last year
• stevedonovan / llib
  A compact library for C99 (and MSVC in C++ mode) providing refcounted arrays, maps, lists and a cool lexical scanner.
  ☆41Updated 8 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆46Updated 6 years ago
• genericsimd / generic_simd
  Generic SIMD intrinsic to allow for portable SIMD intrinsic programming
  ☆42Updated 11 years ago
• valyala / gheap
  Fast generalized heap tree algorithms in C++ and C. Provides simultaneous support for D-heap and B-heap.
  ☆134Updated 5 years ago
• LiveAsynchronousVisualizedArchitecture / lava
  Live Asynchronous Visualized Architecture
  ☆96Updated 6 years ago
• felix-lang / judy
  A C library for creating and accessing dynamic arrays with near O(log-base-256) scalability into the peta-element range
  ☆32Updated 14 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆29Updated 3 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆56Updated 2 years ago
• kobalicek / mpsl
  Shader-Like Mathematical Expression JIT Engine for C++ Language
  ☆58Updated 5 years ago
• stepcode / baffledCitrus
  Perplex, Lemon, and Re2c: A cross-platform lexer/parser replacement for flex and bison
  ☆30Updated 9 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆100Updated 2 years ago
• pvachon / rbtree
  A simple, intrusive, zero-allocation red-black tree implementation
  ☆46Updated 3 years ago
• ned14 / uthash
  A GIT clone of uthash.sourceforge.net, a hash table, implemented in C, supporting constant-time add/find/remove of C structures. Any stru…
  ☆36Updated 11 years ago
• davidar / c-hashtable
  Git mirror of the hash table data structure in C by Christopher Clark ⛺
  ☆46Updated 6 years ago
• AntonioFerrandez / MergedTrie
  MergedTrie code
  ☆12Updated 5 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆118Updated 8 years ago