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
  ☆132Updated 4 months ago
• lemire / fasthashing
  A Variable-Length String Hashing Library in C++
  ☆44Updated 5 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆98Updated 2 years ago
• Manu343726 / Polyop
  Overridable universal operator overloading for C++14
  ☆20Updated 10 years ago
• mavam / compbench
  Benchmark and visualization of various compression algorithms
  ☆23Updated 9 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated 2 years ago
• tarsa / SortingAlgorithmsBenchmark
  ☆15Updated 10 years ago
• eloraiby / rl-json-parser
  Ragel/Lemon based json-parser
  ☆17Updated 6 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 5 years ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆59Updated 3 years ago
• preshing / CompareIntegerMaps
  Generates benchmark data for two different data structures, then renders some graphs.
  ☆112Updated 5 years ago
• balena / radixdb
  Static Radix Tree (Patricia trie) implementation in C
  ☆46Updated 7 years ago
• mackstann / hash-table-shootout
  A benchmark of some prominent C/C++ hash table implementations
  ☆103Updated 5 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆28Updated 2 years ago
• wichtounet / cpm
  Continuous Perfomance Monitor (CPM) for C++ code
  ☆40Updated last year
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆82Updated last year
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 9 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆105Updated 8 years ago
• daniel-j-h / cppnow2016
  C++Now 2016 talk - Pulling Visitors: Boost.Graph + Boost.Coroutine
  ☆9Updated 8 years ago
• matovitch / cosche
  A dependency-based coroutine scheduler
  ☆46Updated 8 years ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆116Updated 7 years ago
• hellige / ccs-cpp
  CCS in C++
  ☆25Updated last year
• maximecaron / SIMD-Based-Posting-lists
  Implementation of Alexander A. Stepanov inverted Index Compression algorithms
  ☆21Updated 9 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆63Updated 8 months ago
• BartMassey / popcount
  popcount algorithms in C and Rust
  ☆30Updated 3 months ago
• mulle-concurrent / mulle-concurrent
  📶 A lock- and wait-free hashtable (and an array too)
  ☆109Updated 3 weeks ago
• abudnik / tcalc
  C++ compile-time Prolog interpreter
  ☆66Updated 10 years ago
• stevedonovan / llib
  A compact library for C99 (and MSVC in C++ mode) providing refcounted arrays, maps, lists and a cool lexical scanner.
  ☆41Updated 7 years ago
• silentbicycle / skiparray
  unrolled skip list library for C
  ☆21Updated 5 years ago