Formalization Of Transcription And Translation Processes By Turing Machines
| dc.contributor.advisor | Stojkovic, Vojislav | |
| dc.contributor.advisor | Sakk, Eric | |
| dc.contributor.author | Drabo, Hassane Kalifa | |
| dc.contributor.department | Computer Science and Bioinformatics Program | en_US |
| dc.contributor.program | Master of Science | en_US |
| dc.date.accessioned | 2018-04-27T15:04:01Z | |
| dc.date.available | 2018-04-27T15:04:01Z | |
| dc.date.issued | 2015 | |
| dc.description.abstract | The human nuclear genome consists of a set of 23 pairs of chromosomes which is made of long DNA molecules that contain information bytes called genes. The human genome contains about 21,000 genes. In the cell, each of the genes codes for a specific protein and is assigned a specific function. Transcription and translation are the processes used by cells to produce a string of amino acids that is a foundation of protein. Transcription: Transcription occurs in the nucleus where the cell copies the gene sequence into messenger RNA (mRNA). This is the first step of gene expression where a complementary DNA sequence is produced. Translation: The ribosome which consists of RNA and proteins reads the mRNA sequence and translates it into the amino acid sequence of the protein. The ribosome reads three nucleotides at a time. Each three-nucleotide codon specifies a particular amino acid. The nucleotide triplets are "stop" codons (UAA, UAG, and UGA) that signal the ribosome that the protein is complete. The goals and accomplishments in this research are: • Design Turing machines to simulate the famous transcription and translation problem • Formally describe the transcription and translation problem using Turing machines terminology (states, rules) • Implement unrestricted grammar (a type 0 grammar) that defines/specifies the language of transcription and translation processes. • Compute the complexity of the transcription and translation problem. The final solution is the composition of over forty Visual Turing machines. This research is very important because this is one of the first successful attempts to describe biochemical processes in a formal way and move biology from an experimental science into a computational science. | |
| dc.genre | theses | |
| dc.identifier | doi:10.13016/M26M33637 | |
| dc.identifier.uri | http://hdl.handle.net/11603/9913 | |
| dc.language.iso | en | |
| dc.relation.isAvailableAt | Morgan State University | |
| dc.rights | This item is made available by Morgan State University for personal, educational, and research purposes in accordance with Title 17 of the U.S. Copyright Law. Other uses may require permission from the copyright owner. | |
| dc.subject | Proteins--Synthesis | en_US |
| dc.subject | Bioinformatics | en_US |
| dc.subject | Turing machines | en_US |
| dc.title | Formalization Of Transcription And Translation Processes By Turing Machines | |
| dc.type | Text |