Optimize global alignment of DNA sequences up to 1000bp in length through a dynamic programming algorithm. Additionally, mine match/mismatch scores from a user-provided matrix utilizing NumPy to determine sequence score. The algorithm completes in O(n^2) time complexity, and has no errors with alignment or scoring.
-
Notifications
You must be signed in to change notification settings - Fork 0
wrickord/Optimal-Global-Alignment-Algorithm
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published