Key-Value Storage Database
-
Updated
Sep 10, 2024 - C++
Key-Value Storage Database
Bumped Ribbon Retrieval and Approximate Membership Query
BM25 algorithm using bloom filters in inverted index to allow fast querying of high-df tokens.
Common engineering data structures and algorithms, such as linear,tree,linked list,graph,greedy,divide and conquer,dynamic programming, backtracking, depth search, breadth search and so on
A fast and space-efficient pre-filter for querying very large collections of nucleotide sequences.
Bioinformatics Technology Lab common code library
C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
🔬 Assemble large genomes using short reads
advanced programming course focused on C++ programming (C++23)
✏️ Genome assembly polishing & SNV detection
The third assignment for AUT's Advanced Programming course (Spring 2024), focusing on the implementation and understanding of Bloom Filters and Tries. These structures optimize space and search operations, crucial for network systems and data processing.
Fast hash function for DNA/RNA sequences
A Bloom filter implementation.
A grahics/videogame engine writen in C++ using OpenGL.
Munt is a witness-secured decentralized network for payments, digital assets, finance and more
High-speed Bloom filters and taffy filters for C, C++, and Java
Add a description, image, and links to the bloom-filter topic page so that developers can more easily learn about it.
To associate your repository with the bloom-filter topic, visit your repo's landing page and select "manage topics."