Publication Date
2009
Degree Type
Master's Project
Degree Name
Master of Science (MS)
Department
Computer Science
Abstract
This project defines and intends to solve the problem of representing information carried by DNA sequences in terms of amino acids, through application of the theory of finite automata. Sequences can be compared against each other to find existing patterns, if any, which may include important genetic information. Comparison can state whether the DNA sequences belong to the same, related or entirely different species in the ‘Tree of Life’ (phylogeny). This is achieved by using extended and statistical finite automata. In order to solve this problem, the concepts of automata and their extension, i.e. Alergia algorithm have been used. In this specific case, we have used the chemical property - polarity of amino acids to analyze the DNA sequences.
Recommended Citation
Shah, Asmi, "DNA Sequence Representation by Use of Statistical Finite Automata" (2009). Master's Projects. 40.
DOI: https://doi.org/10.31979/etd.hpx4-ds3g
https://scholarworks.sjsu.edu/etd_projects/40
