Alternatives and similar repositories for Ukkonen-SuffixTree:

Users that are interested in Ukkonen-SuffixTree are comparing it to the libraries listed below

• molpopgen / libsequence
  libsequence: a C++ class library for evolutionary genetic analysis
  ☆53Updated 4 years ago
• bingmann / cobs
  COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
  ☆84Updated last year
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆63Updated 10 months ago
• rantala / string-sorting
  A collection of string sorting algorithms
  ☆55Updated 3 years ago
• lemire / SIMDIntersections
  Vectorized intersections (research code)
  ☆15Updated 8 years ago
• nicolaprezza / BWTIL
  BWT Text Indexing Library: a set of tools to work with BWT-based text indexes
  ☆25Updated 2 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆98Updated 2 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated 10 months ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• ParBLiSS / parconnect
  Computes graph connectivity for large graphs
  ☆11Updated 8 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• mpetri / FM-Index
  FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…
  ☆105Updated 10 years ago
• jltsiren / relative-fm
  Relative data structures based on the BWT
  ☆12Updated 6 years ago
• attractivechaos / sann
  Simply feedforward neural network
  ☆19Updated 8 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆45Updated 6 years ago
• eriksjolund / diagonalsw
  C/C++ implementation of the Smith-Waterman algorithm by using SIMD operations (e.g SSE4.1)
  ☆23Updated 8 years ago
• gmarcais / compact_vector
  Bit packed vector of integral values
  ☆27Updated 2 months ago
• ocfnash / FM-Index
  C++ implementation of FM Index data structure wrapped in Python
  ☆13Updated 2 years ago
• ekg / mmmulti
  memory mapped multimap, multiset, and implicit interval tree based on an in-place parallel sort
  ☆27Updated 4 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• GuillaumeHolley / BloomFilterTrie
  An alignment-free, reference-free and incremental data structure for colored de Bruijn graph with application to pan-genome indexing.
  ☆43Updated 3 years ago
• ekg / intervaltree
  a minimal C++ interval tree implementation
  ☆229Updated 4 years ago
• nicolaprezza / lz-rlbwt
  Run-length compressed BWT with LZ77 sampled suffix array
  ☆10Updated 2 years ago
• mackstann / hash-table-shootout
  A benchmark of some prominent C/C++ hash table implementations
  ☆103Updated 6 years ago
• pelotoncycle / bsort
  Extremely fast inplace radix sort
  ☆42Updated 5 years ago
• jermp / lphash
  Fast and compact locality-preserving minimal perfect hashing for k-mer sets.
  ☆43Updated last year
• jltsiren / bwt-merge
  A tool for merging large BWTs
  ☆26Updated 4 years ago
• rchikhi / benchmphf
  Benchmark of four minimal perfect hash libraries (phf, emphf, CMPH, Sux4J)
  ☆13Updated 7 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
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆49Updated 5 years ago