Alternatives and similar repositories for hmsearch

Users that are interested in hmsearch are comparing it to the libraries listed below

• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 5 years ago
• naskitis / Cache-Conscious-Data-Structures
  The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
  ☆42Updated 8 years ago
• pytries / hat-trie
  HAT-Trie for Python
  ☆86Updated 9 years ago
• splatlab / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆15Updated 6 years ago
• farsightsec / mtbl
  immutable sorted string table library
  ☆80Updated 5 months ago
• lvv / lvvlib
  C++ utility library
  ☆24Updated 11 years ago
• willemt / bmon
  Batch Monitor - Gain performance by combining work from multiple threads into a single batch
  ☆30Updated 10 years ago
• patrickfrey / strus
  Library implementing the storage and the query evaluation for a text search engine. It uses on a key value store database interface to st…
  ☆47Updated 3 years ago
• xhochy / libfuzzymatch
  C++11 library for fast fuzzy searching
  ☆14Updated 9 years ago
• discoproject / discodb
  An efficient, immutable, persistent mapping object
  ☆98Updated 6 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• xxsds / multi_index
  A C++ template library for compact Hamming distance indexes
  ☆10Updated 8 years ago
• simongog / RoSA
  Reduced on-disk Suffix Array
  ☆21Updated 11 years ago
• stevedekorte / vertexdb
  C based graph db server using tokyocabinet & libevent
  ☆296Updated 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
• seomoz / simhash-cpp
  Simhashing in C++
  ☆132Updated 2 years ago
• commonsmachinery / blockhash
  ☆89Updated last year
• cmaloney / orly
  Orly™ Graph Database
  ☆39Updated last year
• rads / sqlite-okapi-bm25
  📑 SQLite extension to add the Okapi BM25 ranking algorithm
  ☆35Updated 9 years ago
• fsaintjacques / libtwiddle
  bit & sketches data structures
  ☆60Updated 6 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 14 years ago
• connexio / cypb
  Fast Protocol Buffers module for Python
  ☆40Updated 9 years ago
• chango / hustle
  Fork of Hustle - Originally developed at Chango - A column oriented, embarrassingly distributed relational event database.
  ☆44Updated 10 years ago
• jonasfj / trilite
  An inverted trigram index for accelerated string matching in Sqlite.
  ☆78Updated 11 years ago
• apache / lucy
  Mirror of Apache Lucy
  ☆99Updated 7 years ago
• rasky / gcs
  Golomb Coded Sets
  ☆93Updated 8 years ago
• ankoh / duckdb.js
  ☆24Updated 4 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 8 years ago
• simongog / sdsl
  Succinct Data Structure Library
  ☆106Updated 11 years ago
• reverbrain / eblob
  Eblob is an append-only low-level IO library, which saves data in blob files. Created as low-level backend for elliptics
  ☆104Updated 5 years ago