➗ SIMD-accelerated bitwise hamming distance Python module for hexadecimal strings
-
Updated
Feb 10, 2023 - C++
➗ SIMD-accelerated bitwise hamming distance Python module for hexadecimal strings
A C++ implementation of N Puzzle problem using A Star Search with heuristics of Manhattan Distance, Hamming Distance & Linear Conflicts
A sliding puzzle game and solver using ncurses.
Python BK-Tree module based on a C++ implementation
Parallel implementation of MSVBS ( MacKay-Smarandache-Vontobel-Butler-Siegel) upper bound estimation of code distance ( Hamming distance) using MPI (multi tread CPU and Cluster)
HUMID: reference free FastQ deduplication
Solves puzzles of various sizes
Upper bound on code distance of QC-LDPC codes based on MacKay-Vontobel-Smarandache
MAG for approximate pattern matching (MAGA)
A practical index for approximate dictionary matching with few mismatches.
A proof-of-concept program for lightweight fingerprints for fast approximate keyword matching using bitwise operations.
Search and clustering vectors in C++
Team Pythagoras of the HackBio Virtual Internship, 2021
Add a description, image, and links to the hamming-distance topic page so that developers can more easily learn about it.
To associate your repository with the hamming-distance topic, visit your repo's landing page and select "manage topics."