DNA MOTIF IDENTIFICATION USING LPBS

Authors

  • Hazaruddin Harun School of Computing, UUM College of Art and Sciences, Universiti Utara Malaysia, 06010 UUM Sintok, Kedah Darulaman, Malaysia
  • Sharifah Lailee Syed Abdullah Faculty of Computer and Mathematical Sciences, Universiti Teknologi MARA, 02600 Arau, Perlis, Malaysia
  • Hamirul Aini Hambali School of Computing, UUM College of Art and Sciences, Universiti Utara Malaysia, 06010 UUM Sintok, Kedah Darulaman, Malaysia

DOI:

https://doi.org/10.11113/jt.v78.9008

Keywords:

Generalized hyperbolic distribution, portfolio optimization

Abstract

In recent years, several deoxyribonucleic acid (DNA)-based approaches have been developed for species identification including DNA sequencing.  The search for motif or patterns in DNA sequences is important in many fields especially in biology. In this paper, a new particle swarm optimization (PSO) approach for discovering species-specific motifs was proposed.  The new method named as Linear-PSO with Binary Search (LPBS) is developed to discover motifs of specific species through DNA sequences.  This enhanced method integrates Linear-PSO and binary search technique to minimize the execution time and to increase the correctness in identifying the motif.  In this study, two fragments samples of ‘mitochondrial cytochrome C oxidase subunit I’ (COI or COX1) were collected from the Genbank online database. DNA sequences for the first sample are fragments of COI for one species and the second samples are a complete COI from a different species. The genome of COI was used as a reference set and other DNA sequences were used as a comparison set. The results show that the LPBS algorithm is able to discover motifs of a species when using DNA sequences from the same fragment of COI. 

References

Karabulut, M. & Ibrikci, T. 2012. A Bayesian Scoring Scheme Based Particle Swarm Optimization Algorithm to Identify Transcription Factor Binding Sites. Applied Soft Computing, 12: 2846-2855.

Lei, C. and Ruan, J. 2008. A Particle Swarm Optimization Algorithm for Finding DNA Sequence. IEEE International Conference on Bioinformatics and Biomedicine. Philadelphia.

Hebert, P. D. N., Cywinska, A., Ball, S. L. and deWaard, J. R. 2003. Biological Identification through DNA Barcodes. Proc. R. Soc. Lond. B. 270: 313-322.

Folmer O., Black M., Hoeh W., Lutz R., and Vrijenhoek R. 1994. DNA Primers for Amplication of Mitochondrial Cytochrome C Oxidase Subunit I from Diverse Metazoan Invertebrates. Molecular Marine Biology and Biotechnology. 3(5): 294-299.

Verge, B., Alonso, Y., Valero, J., Miralles, C., Vilella, E., and Martorell, L. 2010. Mitochondrial DNA (mtDNA) and Schizophrenia. European Psychiatry. 26: 45-56,

Hebert, P. D. N., Ratnasingham, S., & deWaard, J. R. 2003. Barcoding Animal Life: Cytochrome C Oxidase Subunit 1 Divergences Among Closely Related Species. Proc Biol Sci. 270(Supp1_1): 96-99.

Arock, M., Reddy, S. and Reddy, A. V. 2010. A Parallel Combinatorial Algorithm for Subtle Motifs. Int. J. Bioinformatics Research and Application. 6(3): 260-269,

Kennedy, J. and Eberhart, R. 1995. Particle Swarm Optimization. IEEE International Conference on Neural Networks. Perth, Australia.

B. C. H. Chang, A. Ratnaweera, and S. K. Halgamuge, 2004. Particle Swarm Optimization for Protein Motif Discovery. Genetic Programming and Evolvable Machines. 5: 203-214.

C. T. Hardin and E. C. Rouchka. 2005. DNA Motif Detection Using Particle Swarm Optimization and Expectation-Maximization. IEEE Symposium on Swarm Intelligence.

W. Zhou, H. Zhu, G. Liu, Y. Huang, Y. Wang, D. Han, and C. Zhou. 2005. A Novel Computational Based Method for Discovery of Sequence Motifs from Co expressed Genes. International Journal of Information Technology. 11.

R. Akbari and K. Ziarati. 2009. An Efficient PSO Algorithm for Motif Discovery in DNA. IEEE International Conference of Emerging Trends in Computing. Tamil Nadu, India.

S. L. Syed Abdullah, H. Harun and M. N. Taib. 2010. A Modified Algorithm for Species Specific Motif Discovery. International Conference on Science and Social Research, Kuala Lumpur.

S. L. Syed Abdullah and H. Harun. 2011. Motif Discovery using Linear-Pso with Binary Search. 2nd World Conference on Information Technology. Turkey.

Downloads

Published

2016-06-13

Issue

Section

Science and Engineering

How to Cite

DNA MOTIF IDENTIFICATION USING LPBS. (2016). Jurnal Teknologi, 78(6-5). https://doi.org/10.11113/jt.v78.9008