Use the Needleman-Wunsch algorithm to align two sequences: s1 and s2. Assume that a match = +2, mismatch = -2, gap = -2
-
Updated
Jun 22, 2020 - Python
#
needleman
Here are 7 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
implementation and visualizations for sequence alignment algorithms
react
bioinformatics
algorithms
reactjs
smith-waterman
needleman-wunsch
alignment
needleman-wunsch-algorithm
needleman
smith-waterman-alignment
dot-plot
-
Updated
May 28, 2021 - JavaScript
A utility library for comparing strings via the Needleman-Wunsch algorithm
csharp
string
dotnet
dynamic
utils
comparison
fuzzy
needlemanwunsch
needleman
wunsch
needlemanwunschutil
-
Updated
Nov 21, 2024 - C#
Programas usados em BioInformática
needleman-wunsch
transcription
debruijn
bioinformatics-scripts
needleman-wunsch-algorithm
needleman
debruijn-graph
ribosome
bioinformatica
-
Updated
Nov 16, 2021 - Jupyter Notebook
Improve this page
Add a description, image, and links to the needleman topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the needleman topic, visit your repo's landing page and select "manage topics."