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
• julesjacobs / levenshtein
  A simple proof of concept levenshtein automaton in Python
  ☆108Updated 10 years ago
• pytries / hat-trie
  HAT-Trie for Python
  ☆86Updated 9 years ago
• discoproject / discodb
  An efficient, immutable, persistent mapping object
  ☆98Updated 6 years ago
• uwescience / raco
  Compilation and rule-based optimization framework for relational algebra. Raco is the language, optimization, and query translation layer…
  ☆74Updated 7 years ago
• simongog / RoSA
  Reduced on-disk Suffix Array
  ☆22Updated 12 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
• 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
• brentp / fastbit-python
  pythonic access to fastbit
  ☆26Updated 7 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
• universal-automata / liblevenshtein
  Various utilities regarding Levenshtein transducers.
  ☆68Updated 5 years ago
• diffeo / py-nilsimsa
  Locality-sensitive hashing algorithm for text similarity comparisons
  ☆58Updated 6 months ago
• rescrv / Replicant
  A system for maintaining replicated state machines
  ☆116Updated 8 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆53Updated 14 years ago
• chango / hustle
  Fork of Hustle - Originally developed at Chango - A column oriented, embarrassingly distributed relational event database.
  ☆44Updated 10 years ago
• gstrauss / mcdb
  mcdb - fast, reliable, simple code to create and read constant databases
  ☆110Updated 2 years ago
• lemire / StronglyUniversalStringHashing
  Benchmark showing the we can randomly hash strings very quickly with good universality
  ☆138Updated 8 months ago
• stevedekorte / vertexdb
  C based graph db server using tokyocabinet & libevent
  ☆299Updated 7 years ago
• dubey / weaver
  A scalable, fast, consistent graph store
  ☆213Updated 8 years ago
• eBay / GZinga
  ☆44Updated 3 years ago
• jonasfj / trilite
  An inverted trigram index for accelerated string matching in Sqlite.
  ☆78Updated 11 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated last year
• commonsmachinery / blockhash
  ☆90Updated last year
• andreasvc / roaringbitmap
  Roaring Bitmap in Cython
  ☆81Updated last year
• 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
• xhochy / libfuzzymatch
  C++11 library for fast fuzzy searching
  ☆14Updated 10 years ago
• michaelmior / mvptree
  A fork of D Grant Starkweather's multiple vantage point tree library
  ☆41Updated 7 years ago
• chalup / dawggenerator
  Fast directed acyclic word graph generator
  ☆91Updated 7 years ago
• farsightsec / mtbl
  immutable sorted string table library
  ☆82Updated 9 months ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆125Updated last year