🔬 🏁 Comparison of DNA Sequences
-
Updated
Aug 13, 2020 - C++
🔬 🏁 Comparison of DNA Sequences
Sequence Alignment (Needleman–Wunsch Algorithm using Dynamic Programming) for aligning sequences (words, sentences, DNA etc.)
Needleman–Wunsch algorithm implementation in Go.
This project implements the Needleman-Wunsch algorithm for dynamic pairwise sequence alignment. Crucial in bioinformatics, sequence alignment compares DNA sequences to understand genetic relationships, evolution, and genomics. The goal is to align DNA sequences optimally using predefined scoring for matches, mismatches, and gaps.
Needleman–Wunsch algorithm implementation in Lua.
A utility library for comparing strings via the Needleman-Wunsch algorithm
Add a description, image, and links to the needlemanwunsch topic page so that developers can more easily learn about it.
To associate your repository with the needlemanwunsch topic, visit your repo's landing page and select "manage topics."