🪼 a python library for doing approximate and phonetic matching of strings.
-
Updated
Jun 3, 2024 - Jupyter Notebook
🪼 a python library for doing approximate and phonetic matching of strings.
Accelerating the deduplication and collapsing process for reads with Unique Molecular Identifiers (UMI). Heavily optimized for scalability and orders of magnitude faster than a previous tool.
Hamming Method Error Correction
Heyming is a hamming code encoder and decoder built in React.js
🦀📏 Rust library to compare strings (or any sequences). 25+ algorithms, pure Rust, common interface, Unicode support.
Cross-platform Desktop App for data Protection and Compression using Hamming's and Huffman's algorithms
Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance calculations and string search.
C++ code of some popular error detection and corrction methods
Alignment-free FASTQ deduplication.
Approximate pattern matching with Counting Filter on q-grams using SSE instructions (CF2)
In coding theory, Hamming (7,4) is a linear error-correcting code that encodes four bits of data into seven bits by adding three parity bits. The project implements a even parity correcting code.
Filling missed data-points with the most common values among nearest neighbors
Add a description, image, and links to the hamming topic page so that developers can more easily learn about it.
To associate your repository with the hamming topic, visit your repo's landing page and select "manage topics."