This was a project for my bioinformatics class. We studied a dynamic programming algorithm (& backtracking) for finding the most optimum pairwise alignment between two DNA sequences. This is that algorithm and backtracking to find one & then all the optimum alignments of two sequences (accepted in .fasta format). Implemented in swift.
-
Notifications
You must be signed in to change notification settings - Fork 0
This was a project for my bioinformatics class. We studied a dynamic programming algorithm (& backtracking) for finding the most optimum pairwise alignment between two DNA sequences. This is that algorithm and backtracking to find one & then all the optimum alignments of two sequences (accepted in .fasta format). Implemented in swift.
mfileman/DNA-Pairwise-Alignment
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
This was a project for my bioinformatics class. We studied a dynamic programming algorithm (& backtracking) for finding the most optimum pairwise alignment between two DNA sequences. This is that algorithm and backtracking to find one & then all the optimum alignments of two sequences (accepted in .fasta format). Implemented in swift.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published