-
Notifications
You must be signed in to change notification settings - Fork 0
(专业写作期末课程设计) DNA alignment is the most basic problem in bioinformatics. Using computers to study DNA alignment is also a hot issue. There are two basic ways to achieve optimal DNA sequence matching. Divide- and -Conquer Algorithm and dynamic programming algorithm. Using these two algorithms, we can get the cost of optimal matching. After improv…
n719710930/DNA-Sequence-Alignment-Algorithm
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
About
(专业写作期末课程设计) DNA alignment is the most basic problem in bioinformatics. Using computers to study DNA alignment is also a hot issue. There are two basic ways to achieve optimal DNA sequence matching. Divide- and -Conquer Algorithm and dynamic programming algorithm. Using these two algorithms, we can get the cost of optimal matching. After improv…
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published