Alternatives and similar repositories for fm-index:

Users that are interested in fm-index are comparing it to the libraries listed below

• kampersanda / sucds
  Collection of succinct data structures in Rust
  ☆96Updated last month
• 10XGenomics / rust-shardio
  Out-of-memory sorting of large datasets map / reduce style processing
  ☆47Updated last month
• Cydhra / vers
  Succinct data structures using very efficient rank and select
  ☆114Updated 3 weeks ago
• Daniel-Liu-c0deb0t / triple_accel
  Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance cal…
  ☆108Updated 2 years ago
• vigna / sux-rs
  Rust implementations of succinct data structures
  ☆58Updated this week
• rossanoventurini / qwt
  A Rust implementation of the Quad Wavelet Tree
  ☆40Updated this week
• sarah-quinones / fastdiv
  ☆35Updated 3 years ago
• CarlKCarlK / range-set-blaze
  Integer sets as fast, sorted, integer ranges with full set operations
  ☆84Updated last week
• dpc / pariter
  Parallel iterator processing library for Rust
  ☆104Updated last year
• eugene-bulkin / rust-bk-tree
  A BK-tree implementation in Rust.
  ☆40Updated last year
• tov / succinct-rs
  Succinct Data Structures for Rust
  ☆57Updated last year
• 10XGenomics / rust-boomphf
  Fast and scalable minimal perfect hashing for massive key sets
  ☆139Updated 9 months ago
• diffeo / kodama
  Fast hierarchical agglomerative clustering in Rust.
  ☆96Updated last week
• Crazytieguy / gat-lending-iterator
  ☆21Updated 7 months ago
• petabi / petal-decomposition
  Matrix decomposition algorithms including PCA (principal component analysis) and ICA (independent component analysis)
  ☆21Updated 2 weeks ago
• beling / bsuccinct-rs
  Rust libraries and programs focused on succinct data structures
  ☆137Updated this week
• mccolljr / segvec
  SegVec data structure for rust. Similar to Vec, but allocates memory in chunks of increasing size.
  ☆37Updated last year
• ayazhafiz / xorf
  Xor filters - efficient probabilistic hashsets. Faster and smaller than bloom and cuckoo filters.
  ☆137Updated last year
• main-- / rust-intervaltree
  ☆20Updated last year
• slotThe / rq
  Functional command-line JSON processor with a bidirectional type system
  ☆25Updated last month
• RagnarGrootKoerkamp / PtrHash
  PtrHash minimal perfect hash function, based of PTHash
  ☆53Updated 2 weeks ago
• lerouxrgd / ngt-rs
  Rust wrappers for NGT approximate nearest neighbor search
  ☆38Updated 11 months ago
• jonhoo / ordsearch
  A Rust data structure for efficient lower-bound lookups
  ☆90Updated last year
• whitfin / bytelines
  Read input lines as byte slices for high efficiency
  ☆64Updated last year
• rick-de-water / nonany
  Integer types with customizable niche values
  ☆43Updated 5 months ago
• laysakura / fid-rs
  High performance FID (Fully Indexable Dictionary) library
  ☆24Updated 9 months ago
• wishawa / decurse
  Rust macro to make recursive function run on the heap (i.e. no stack overflow).
  ☆24Updated 3 years ago
• sstadick / rust-lapper
  Rust implementation of a fast, easy, interval tree library nim-lapper
  ☆59Updated last year
• ejmahler / strength_reduce
  Faster integer division and modulus operations
  ☆87Updated 2 years ago
• paulkernfeld / hmmm
  Hidden Markov Models in Rust
  ☆71Updated last year