DNA String alignment using Dynamic Programming. Recursive Smith-Waterman Algorithm.
Just a simple demonstration of how a dynamic programming algorithm can be used to find good DNA string alignments.
-
Notifications
You must be signed in to change notification settings - Fork 0
luisfrt/dnasequence
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
DNA String alignment using Dynamic Programming.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published