🔬 🏁 Comparison of DNA Sequences
-
Updated
Aug 13, 2020 - C++
#
needlemanwunsch
Here are 6 public repositories matching this topic...
Sequence Alignment (Needleman–Wunsch Algorithm using Dynamic Programming) for aligning sequences (words, sentences, DNA etc.)
memoization algorithm algorithms memo dynamic needleman-wunsch optimal pseudocode dynamic-programming patullo noah noah-patullo memorization optimal-substructure optimality algorithm-design needlemanwunsch needleman wunsch patulo
-
Updated
Jan 5, 2019 - Java
A utility library for comparing strings via the Needleman-Wunsch algorithm
csharp string dotnet dynamic utils comparison fuzzy needlemanwunsch needleman wunsch needlemanwunschutil
-
Updated
Feb 12, 2026 - C#
Needleman–Wunsch algorithm implementation in Go.
-
Updated
Apr 11, 2024 - 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.
-
Updated
Jul 8, 2024 - Python
Needleman–Wunsch algorithm implementation in Lua.
-
Updated
Apr 25, 2024 - Lua
Improve this page
Add a description, image, and links to the needlemanwunsch topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the needlemanwunsch topic, visit your repo's landing page and select "manage topics."