This project has two main parts.
- It is a modified Smith Waterman algorithm that can do sequence alignment automatically in python.
- Traditional Smith-Waterman Algorithm
It is a dynamic planning algorithms for sequence alignment.
- Modified Smith-Waterman Algorithm
We made every two bases in the amino acid as a pair and implemented the new Scoring Matrix of 16*16
- It is a crawler in python and bash that can get sequence quickly on NCBI.