[c0deb0t]

High school is out so I am learning SIMD instruction sets, like AVX2 and SSE, and using these to speed up Hamming/Levenshtein distance calculations in Rust. Preliminary testing shows a 20x speedup using vectorized SIMD operations! The end goal is a full Rust library for edit distance routines.

Sneak peek of the code: https://twitter.com/daniel_c0deb0t/status/124224838155819008...

[uoaei]

You could also consider providing bioinformatics routines such as global and local sequence alignment. Under the hood they're very similar algorithms.

https://en.wikipedia.org/wiki/Sequence_alignment

https://en.wikipedia.org/wiki/Needleman%E2%80%93Wunsch_algor...

https://en.wikipedia.org/wiki/Smith%E2%80%93Waterman_algorit...

[c0deb0t]

Though I probably won't implement the different weighting schemes, I currently have alignment traceback and searching (allow "free shifts" for the pattern string) features.