GitHub - dchid/Longest-Common-DNA-subsequence: An implementation of the Longest Common Subsequence that sequences randomly generated DNA

dchid / Longest-Common-DNA-subsequence Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

An implementation of the Longest Common Subsequence that sequences randomly generated DNA

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 9 Commits
nbproject		nbproject
src/longest/common/subsequence		src/longest/common/subsequence
.gitignore		.gitignore
README.txt		README.txt
build.xml		build.xml
manifest.mf		manifest.mf

Repository files navigation

This project was made for the Analysis of algorithms course at Willamette University. 
It generates a random sequence of DNA with nitrogen bases represented by ascii characters.*

A = Adenine
T = Thymine
G = Guanine
C = Cytosine

*note that the chosen bases are completely random and will make a sequence of codons or proteins which will probably not be applicable in actual DNA

The purpose of the assignment is an analysis and implimentation of the longest common subsecuence algorithm
The dynamic itterative implimentation is obviously much faster than the brute force implimentation.