Alhersh, Taha Talib Ragheb (2009) Analyzing DNA Sequences Using Clustering Algorithm. Masters thesis, Universiti Utara Malaysia.
Taha_Taleb_Ragheb_Alhersh.pdf
Download (814kB) | Preview
1.Taha_Taleb_Ragheb_Alhersh.pdf
Download (70kB) | Preview
Abstract
Data mining gives a bright prospective in DNA sequences analysis through its concepts and techniques. This study carries out exploratory data analysis method to cluster DNA sequences.Feature vectors have been developed to map the DNA sequences to a twelve-dimensional vector in the space. Lysozyme, Myoglobin and Rhodopsin protein families have been tested in this space. The results of DNA sequences comparison among homologous sequences give close distances between their characterization vectors which are easily distinguishable from non-homologous in experiment it with a fixed DNA sequence size that does not exceed the maximum length of the shortest DNA sequence. Global comparison for multiple DNA sequences simultaneously presented in the genomic space is the main advantage of this work by applying direct comparison of the corresponding characteristic vectors distances. The novelty of this work is that for the new DNA sequence, there is no need to compare the new DNA sequence with the whole DNA sequences length, just the comparison focused on a fixed number of all the sequences in a way that does not exceed the maximum length of the new DNA sequence. In other words, parts of the DNA sequence can identify the functionality of the DNA sequence, and make it clustered with its family members.
Item Type: | Thesis (Masters) |
---|---|
Supervisor : | UNSPECIFIED |
Item ID: | 1913 |
Uncontrolled Keywords: | Data Mining, DNA Sequences Analysis, Computer Algorithm |
Subjects: | Q Science > QA Mathematics > QA76 Computer software |
Divisions: | College of Arts and Sciences (CAS) |
Date Deposited: | 10 Jun 2010 08:25 |
Last Modified: | 21 Apr 2022 03:28 |
Department: | College of Arts and Sciences |
URI: | https://etd.uum.edu.my/id/eprint/1913 |