🪼 a python library for doing approximate and phonetic matching of strings.

🎯 String metrics and phonetic algorithms for Scala (e.g. Dice/Sorensen, Hamming, Jaccard, Jaro, Jaro-Winkler, Levenshtein, Metaphone, N-Gram, NYSIIS, Overlap, Ratcliff/Obershelp, Refined NYSIIS, Refined Soundex, Soundex, Weighted Levenshtein).

📚 String comparison and edit distance algorithms library, featuring : Levenshtein, LCS, Hamming, Damerau levenshtein (OSA and Adjacent transpositions algorithms), Jaro-Winkler, Cosine, etc...

🦀📏 Rust library to compare strings (or any sequences). 25+ algorithms, pure Rust, common interface, Unicode support.

Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance calculations and string search.

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.

Distance/Similarity functions for Bag of Words, Strings, Vectors and more.

MATLAB/Octave generator of Hamming ECC coding. Output format is Verilog HDL.

Variable Length Hamming Code Encoder & Error Detecting / Correcting Decoder (Odd & Even Parity), implemented in C++

Network protocol libraries for VHDL test benches

Heyming is a hamming code encoder and decoder built in React.js

Error correction codes in python.

A general, multi-threaded fuzzy searching language, called fuzzysplit, that is built on top of a fast and flexible Java fuzzy search library. Can be applied to demultiplex and trim DNA.

Voice Analyzer: Specialized in emotion detection, this Matlab app focuses on discerning anger and normal tones. Experience targeted insights, offering a nuanced perspective on voice sentiments.

This project was completed in 2018 as a part of my postgraduate studies in Biomedical Engineering

Go port of the python jellyfish module for approximate and phonetic matching of strings.

VHDL library for error correcting functions and components

An implementation of the A* search algorithm to solve the 8-puzzle problem, with two different heuristics.