Alternatives and similar repositories for hmsearch

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

• rasky / gcs
  Golomb Coded Sets
  ☆94Updated 8 years ago
• commonsmachinery / blockhash
  ☆89Updated last year
• 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
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• simongog / RoSA
  Reduced on-disk Suffix Array
  ☆21Updated 11 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• stevedekorte / vertexdb
  C based graph db server using tokyocabinet & libevent
  ☆297Updated 7 years ago
• fusiyuan2010 / cuttdb
  a hash-based key-value database for persistent storing massive small records
  ☆40Updated 11 years ago
• chango / hustle
  Fork of Hustle - Originally developed at Chango - A column oriented, embarrassingly distributed relational event database.
  ☆44Updated 10 years ago
• cliqz-oss / keyvi
  Keyvi - a key value index that powers Cliqz search engine. It is an in-memory FST-based data structure highly optimized for size and look…
  ☆177Updated 6 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
• chalup / dawggenerator
  Fast directed acyclic word graph generator
  ☆91Updated 7 years ago
• discoproject / discodb
  An efficient, immutable, persistent mapping object
  ☆98Updated 6 years ago
• rads / sqlite-okapi-bm25
  📑 SQLite extension to add the Okapi BM25 ranking algorithm
  ☆35Updated 10 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 5 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆123Updated last year
• lvv / lvvlib
  C++ utility library
  ☆24Updated 11 years ago
• cmaloney / orly
  Orly™ Graph Database
  ☆39Updated last year
• uwescience / raco
  Compilation and rule-based optimization framework for relational algebra. Raco is the language, optimization, and query translation layer…
  ☆73Updated 7 years ago
• gstrauss / mcdb
  mcdb - fast, reliable, simple code to create and read constant databases
  ☆111Updated 2 years ago
• julesjacobs / levenshtein
  A simple proof of concept levenshtein automaton in Python
  ☆108Updated 9 years ago
• pytries / hat-trie
  HAT-Trie for Python
  ☆86Updated 9 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 14 years ago
• dcreager / libpush
  An arrow-based parser combinator library for C
  ☆40Updated 15 years ago
• mettienne / tiered-vector
  Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…
  ☆50Updated last year
• biometrics / likely
  A compiler intermediate representation for image recognition and heterogeneous computing.
  ☆78Updated 9 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 8 years ago
• microsoft / QBASHER
  Inverted file indexing and retrieval optimized for short texts. Supports auto-suggest and query segment classification.
  ☆34Updated 2 years ago
• pcarrier / cdb64
  Format-incompatible 64-bit version of cdb (no 4GB limit)
  ☆14Updated 11 years ago