Date Thesis Awarded
5-2008
Access Type
Honors Thesis -- Access Restricted On-Campus Only
Degree Name
Bachelors of Science (BS)
Department
Mathematics
Advisor
Chi-Kwong Li
Committee Members
Sarah Day
Jianjun Paul Tian
Margaret Somosi Saha
Abstract
The genetic code-based matrices constructed in this work and the corresponding hamming distance matrices are studied using combinatorics and linear algebra approaches. Recursive schemes for generating the matrices are obtained. Algebraic properties such as ranks, eigenvalues, and eigenvectors of the Hamming distance matrices are examined. The results lead to an easy calculation of the powers of the Hamming distance matrices. Moreover, a decomposition of the Hamming Distance matrices in terms of permutation matrices is obtained. The decomposition gives rise to hypercube structures to the genetic code based matrices. A new scheme is given to generate matrices where each entry is a 4-tuple, which counts the number of each nucleotide in the entries of the genetic code matrix. Connections and potential applications of the results will be discussed.
Recommended Citation
Crowder, Tanner Jennings, "A Study of Genetic Code by Combinatorics and Linear Algebra Approaches" (2008). Undergraduate Honors Theses. William & Mary. Paper 836.
https://scholarworks.wm.edu/honorstheses/836
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 License.
Comments
Thesis is part of Honors ETD pilot project, 2008-2013. Migrated from Dspace in 2016.