Linear-pso with binary search algorithm for DNA motif discovery / Hazaruddin Harun

Harun, Hazaruddin (2015) Linear-pso with binary search algorithm for DNA motif discovery / Hazaruddin Harun. PhD thesis, Universiti Teknologi MARA.

[img]
Preview
Text
TP_HAZARUDDIN HARUN CS 15_5.pdf

Download (7MB) | Preview

Abstract

Motif Discovery (MD) is the process of identifying meaningful patterns in DNA, RNA, or protein sequences. In the field of bioinformatics, a pattern is also known as a motif. Numerous algorithms had been developed for MD, but most of these were not designed to discover species specific motifs used in identifying a specifically selected species where the exact location of these motifs also needs to be identified. Evaluation of these algorithms showed that the results are unsatisfactory due to the lower validity and accuracy of these algorithms. At present, DNA sequencing analysis is the most utilised technique for species identification where patterns of DNA sequences are determined by comparing the sequence to comprehensive databases. However, several false and gap sequences had been identified to be present in these databases which lead to false identification. Therefore, this study addresses these problems by introducing a hybrid algorithm for MD. In this study, the MD is a process to discover all possible motifs that existed in DNA sequences whereas Motif Identification (MI) is a process to identify the correct motif that can represent a selected species. Particle Swarm Optimisation (PSG) was selected as the base algorithm that needs improvement and integration with other techniques. The Linear-PSO algorithm was the first version of improvement. However due to the longer time required for complete execution of this algorithm, the Binary Search technique was integrated and a new version of the algorithm was developed, namely the Linear-PSO with Binary Search (LPBS) algorithm. A total of 11 experiments were conducted in this research, where the aim of the first four experiments was algorithm improvement; the next four experiments were for identifying suitable input data, while the final three experiments were for algorithm validation. Several DNA sequences from different species were collected from the GenBank and TRansCompel databases and used as input for the algorithm. The collected DNA sequences were from the Mitochondrial Cytochrome C Oxidase Subunit I (COXl) gene. Due to the limitation of available data, only four species were collected for Motif Discovery, namely pig, cow, yak, and chicken. Another five species were used for Motif Identification, which were human, sheep, dog, frog, and rat. The algorithm was run on an Intel(R) Core(TM) Duo CPU 1.73 GHz notebook with 3 GB RAM. The results showed that the LPBS algorithm was able to discover possible correct motifs that can represent a species with higher validity and accuracy as compared to previous algorithms. The motifs discovered were consistent for each execution with higher calculated fitness values.

Item Type: Thesis (PhD)
Uncontrolled Keywords: Linear-PSO; Binary search Algorithm; DNA motif discovery
Subjects: Q Science > QA Mathematics > Instruments and machines > Electronic computers.Computer science > Programming. Rule-based programming. Backtrack programming
Q Science > QA Mathematics > Instruments and machines > Electronic computers.Computer science > Programming. Rule-based programming. Backtrack programming

Q Science > QA Mathematics > Instruments and machines > Electronic computers.Computer science > Algorithms
Q Science > QA Mathematics > Instruments and machines > Electronic computers.Computer science > Algorithms
Divisions: Faculty of Computer and Mathematical Sciences
Depositing User: Staf Pendigitan 2
Date Deposited: 17 Feb 2017 01:36
Last Modified: 17 Feb 2017 01:36
URI: http://ir.uitm.edu.my/id/eprint/16103

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year