DNA_Sequence_Alignment

This project was part of CSCI-570 - Analysis of Algorithms at The University of Southern California.

In this project we implement two sequence alignment algorithms.

basic3.py is pure dynamic programming approach.
efficient3.py is memory efficient approach which combines Divide and conquer and dynamic programming.

Name		Name	Last commit message	Last commit date
Latest commit History 38 Commits
2143749103_4727109268_4371197245		2143749103_4727109268_4371197245
SampleTestCases		SampleTestCases
TestFiles		TestFiles
datapoints		datapoints
datapoints_output		datapoints_output
.gitignore		.gitignore
2143749103_4727109268_4371197245.zip		2143749103_4727109268_4371197245.zip
CPU_Time_Graph_Final.jpg		CPU_Time_Graph_Final.jpg
CSCI570_Spring_FinalProject.pdf		CSCI570_Spring_FinalProject.pdf
Memory_Util_Graph_Final.jpg		Memory_Util_Graph_Final.jpg
README.md		README.md
Summary.docx		Summary.docx
Summary.pdf		Summary.pdf
basic.sh		basic.sh
basic_3.py		basic_3.py
efficient.sh		efficient.sh
efficient_3.py		efficient_3.py
fill_summary_docx_table.py		fill_summary_docx_table.py
final_output.csv		final_output.csv
generate_graphs.py		generate_graphs.py
get_output.sh		get_output.sh

HarshOza36/DNA_Sequence_Alignment