GitHub - n719710930/DNA-Sequence-Alignment-Algorithm: (专业写作期末课程设计) 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 improving the dynamic programming algorithm with better performance, we can get the optimal DNA matching sequence.

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 6 Commits
.gitignore		.gitignore
给定DNA序列匹配分置算法.cpp		给定DNA序列匹配分置算法.cpp
给定DNA序列匹配动态规划算法.cpp		给定DNA序列匹配动态规划算法.cpp
（最终）自定DNA序列匹配动态规划算法.cpp		（最终）自定DNA序列匹配动态规划算法.cpp

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…