An In-depth Evaluation of an Optimized Algorithm for DNA Motive Discovery

Amannah Constance Izuchukwu; Ernest Chukwuka Ukwosah

doi:doi:10.11648/j.ijssam.20180304.11

| Peer-Reviewed

An In-depth Evaluation of an Optimized Algorithm for DNA Motive Discovery

Amannah Constance Izuchukwu, Ernest Chukwuka Ukwosah

Published in International Journal of Systems Science and Applied Mathematics (Volume 3, Issue 4)

Received: 29 May 2018 Accepted: 27 June 2018 Published: 7 March 2019

Views: Downloads:

Download PDF

Share This Article

Twitter
Linked In
Facebook

Abstract

Motive Finding is the process of locating the meaningful patterns in the sequence of DNA, RNA or Proteins. There are many widely used algorithms in practice to solve the motive finding problem and these methods are local search methods. Different search algorithms were discussed which are Gibbs sampling, projection, pattern branching, and profile branching. The limitations surrounding them gave an advantage for the selection of the best algorithm in producing an optimized algorithm for the DNA discovery.

Published in	International Journal of Systems Science and Applied Mathematics (Volume 3, Issue 4)
DOI	10.11648/j.ijssam.20180304.11
Page(s)	67-73
Creative Commons	This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited.
Copyright	Copyright © The Author(s), 2019. Published by Science Publishing Group

Keywords

Motive, Optimization, Algorithm, DNA, RNA, Discovery

References

[1]	Bucher, P. (1990). Weight matrix description for four eukaryotic RNA polymerase II promoter element derived from 502 unrelated promoter sequences. J Mol Biol. 1990; 212: 563–578.
[2]	Cliften, P. F., Hillier L. W., Fulton L., Graves T., Miner T., Gish W. R., Waterston R. H., and Johnston M. (2001). Surveying Saccharomyces genomes to Identify functional elements by comparative DNA sequence analysis. Genome Res. 2001; 11: 1175–1186.
[3]	Liu V. S., Brutlag D. J., and Liu L. S. (2002). An algorithm for finding protein DNA binding sites with applications to Chromatin-Immunoprecipitation microarray experiments Nat. Biotechnol. 20835-839.
[4]	Pradhan L., Medha K. (2008). "Motive Discovery in Biological Sequences". Master's Projects. Paper 106. http://scholarworks.sjsu.edu/etd_projects/106
[5]	Pevzner P. A., Sze S.-H. (2000). Combinatorial approaches to finding subtle signals in DNA sequences, ISBM 2000, 269–278.
[6]	Sandelin A, and Wasserman W. W. (2004). Constrained binding site diversity within families of transcription factors enhances pattern discovery Bio informatics J. Mol. Biol. 338207-215.
[7]	Tagle D., Koop B., Goodman M., Slightom J., Hess D., and Jones R. (2003). Embryonic ε and γ globin genes of a prosimian primate (Galago crassicaudatus): nucleotide and amino acid sequences, developmental regulation and phylogenetic footprints. J Mol Biol. 1988; 203: 439–455.
[8]	Reddy S. U., Arock M., and Reddy A. V. (2010). Planted (l, d) – Motive Finding using Particle Swarm Optimization, JCA Special Issue on “Evolutionary Computation for Optimization Techniques” ECOT, 2010.
[9]	Van Helden J., Andre B., and Collado-Vides J. (1998). Extracting regulatory sites from the upstream region of yeast genes by computational analysis of oligonucleotide frequencies. J Mol Biol. 1998; 281: 827–842.
[10]	Casati, R., and Smith, B. (1994, February 7). Naive Physics: An Essay in Ontology. Philosophical Psychology, pp. 7-8. Retrieved April 4, 2018.
[11]	Cohen, P., and Levesque, H. (1990). Intention is choice with commitment, Artificial Intelligence (Vol. 42). Retrieved March 10, 2018.
[12]	Davis, E., and Morgenstern, L. (2004). Introduction: Progress in formal commonsense. New York, U. S. A: Courant Institute, New York University, New York, NY 10012, USA.
[13]	Davis, S., and Lessard, A. (2018). The A. I. Revolution Begins With Augumented Intelligence. Signafire.
[14]	Gilev, S., Gorban, A., and Mirkes, E. (1991). Small experts and internal conflicts in learning neural networks, 320, (pp. 220-223). Retrieved March 12, 2018.
[15]	Gilev, S., Gorban, A., Kochenov, D., Mirkes, Y., Golovenkin, S., Dogadin, S., Shulman, V. (1994). MultiNeuron neural simulator and its medical applications. International Conference On Neural Information Processing, ICONIP1994, 3, (pp. 1261-1264). Retrieved March 13, 2018.
[16]	Gorban, A., Mirkes, E., and Tsaregorodtsev, V. (1999). Generation of explicit knowledge from empirical data through pruning of trainable neural Networks. IJCNN’99. International Joint Conference, 6, pp. 4393-4398. Retrieved March 12, 2018.
[17]	Haugeland, J. (1978). The nature and plausibility of cognitivism. Behavioural and Brain Sciences (1), (pp. 215–226). Retrieved March 13, 2018.

Cite This Article

Plain Text BibTeX RIS

APA Style

Amannah Constance Izuchukwu, Ernest Chukwuka Ukwosah. (2019). An In-depth Evaluation of an Optimized Algorithm for DNA Motive Discovery. International Journal of Systems Science and Applied Mathematics, 3(4), 67-73. https://doi.org/10.11648/j.ijssam.20180304.11

Copy | Download

ACS Style

Amannah Constance Izuchukwu; Ernest Chukwuka Ukwosah. An In-depth Evaluation of an Optimized Algorithm for DNA Motive Discovery. Int. J. Syst. Sci. Appl. Math. 2019, 3(4), 67-73. doi: 10.11648/j.ijssam.20180304.11

Copy | Download

AMA Style

Amannah Constance Izuchukwu, Ernest Chukwuka Ukwosah. An In-depth Evaluation of an Optimized Algorithm for DNA Motive Discovery. Int J Syst Sci Appl Math. 2019;3(4):67-73. doi: 10.11648/j.ijssam.20180304.11

Copy | Download

@article{10.11648/j.ijssam.20180304.11,
  author = {Amannah Constance Izuchukwu and Ernest Chukwuka Ukwosah},
  title = {An In-depth Evaluation of an Optimized Algorithm for DNA Motive Discovery},
  journal = {International Journal of Systems Science and Applied Mathematics},
  volume = {3},
  number = {4},
  pages = {67-73},
  doi = {10.11648/j.ijssam.20180304.11},
  url = {https://doi.org/10.11648/j.ijssam.20180304.11},
  eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.ijssam.20180304.11},
  abstract = {Motive Finding is the process of locating the meaningful patterns in the sequence of DNA, RNA or Proteins. There are many widely used algorithms in practice to solve the motive finding problem and these methods are local search methods. Different search algorithms were discussed which are Gibbs sampling, projection, pattern branching, and profile branching. The limitations surrounding them gave an advantage for the selection of the best algorithm in producing an optimized algorithm for the DNA discovery.},
 year = {2019}
}

Copy | Download

TY  - JOUR
T1  - An In-depth Evaluation of an Optimized Algorithm for DNA Motive Discovery
AU  - Amannah Constance Izuchukwu
AU  - Ernest Chukwuka Ukwosah
Y1  - 2019/03/07
PY  - 2019
N1  - https://doi.org/10.11648/j.ijssam.20180304.11
DO  - 10.11648/j.ijssam.20180304.11
T2  - International Journal of Systems Science and Applied Mathematics
JF  - International Journal of Systems Science and Applied Mathematics
JO  - International Journal of Systems Science and Applied Mathematics
SP  - 67
EP  - 73
PB  - Science Publishing Group
SN  - 2575-5803
UR  - https://doi.org/10.11648/j.ijssam.20180304.11
AB  - Motive Finding is the process of locating the meaningful patterns in the sequence of DNA, RNA or Proteins. There are many widely used algorithms in practice to solve the motive finding problem and these methods are local search methods. Different search algorithms were discussed which are Gibbs sampling, projection, pattern branching, and profile branching. The limitations surrounding them gave an advantage for the selection of the best algorithm in producing an optimized algorithm for the DNA discovery.
VL  - 3
IS  - 4
ER  -

Copy | Download

Author Information

Amannah Constance Izuchukwu

Department of Computer Science, Ignatius Ajuru University of Education, Port Harcourt, Nigeria
Ernest Chukwuka Ukwosah

Department of Computer Science, Federal University, Wukari, Nigeria

Download PDF

Sections

Plain Text BibTeX RIS

APA Style

Amannah Constance Izuchukwu, Ernest Chukwuka Ukwosah. (2019). An In-depth Evaluation of an Optimized Algorithm for DNA Motive Discovery. International Journal of Systems Science and Applied Mathematics, 3(4), 67-73. https://doi.org/10.11648/j.ijssam.20180304.11

Copy | Download

ACS Style

Amannah Constance Izuchukwu; Ernest Chukwuka Ukwosah. An In-depth Evaluation of an Optimized Algorithm for DNA Motive Discovery. Int. J. Syst. Sci. Appl. Math. 2019, 3(4), 67-73. doi: 10.11648/j.ijssam.20180304.11

Copy | Download

AMA Style

Amannah Constance Izuchukwu, Ernest Chukwuka Ukwosah. An In-depth Evaluation of an Optimized Algorithm for DNA Motive Discovery. Int J Syst Sci Appl Math. 2019;3(4):67-73. doi: 10.11648/j.ijssam.20180304.11

Copy | Download

@article{10.11648/j.ijssam.20180304.11,
  author = {Amannah Constance Izuchukwu and Ernest Chukwuka Ukwosah},
  title = {An In-depth Evaluation of an Optimized Algorithm for DNA Motive Discovery},
  journal = {International Journal of Systems Science and Applied Mathematics},
  volume = {3},
  number = {4},
  pages = {67-73},
  doi = {10.11648/j.ijssam.20180304.11},
  url = {https://doi.org/10.11648/j.ijssam.20180304.11},
  eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.ijssam.20180304.11},
  abstract = {Motive Finding is the process of locating the meaningful patterns in the sequence of DNA, RNA or Proteins. There are many widely used algorithms in practice to solve the motive finding problem and these methods are local search methods. Different search algorithms were discussed which are Gibbs sampling, projection, pattern branching, and profile branching. The limitations surrounding them gave an advantage for the selection of the best algorithm in producing an optimized algorithm for the DNA discovery.},
 year = {2019}
}

Copy | Download

TY  - JOUR
T1  - An In-depth Evaluation of an Optimized Algorithm for DNA Motive Discovery
AU  - Amannah Constance Izuchukwu
AU  - Ernest Chukwuka Ukwosah
Y1  - 2019/03/07
PY  - 2019
N1  - https://doi.org/10.11648/j.ijssam.20180304.11
DO  - 10.11648/j.ijssam.20180304.11
T2  - International Journal of Systems Science and Applied Mathematics
JF  - International Journal of Systems Science and Applied Mathematics
JO  - International Journal of Systems Science and Applied Mathematics
SP  - 67
EP  - 73
PB  - Science Publishing Group
SN  - 2575-5803
UR  - https://doi.org/10.11648/j.ijssam.20180304.11
AB  - Motive Finding is the process of locating the meaningful patterns in the sequence of DNA, RNA or Proteins. There are many widely used algorithms in practice to solve the motive finding problem and these methods are local search methods. Different search algorithms were discussed which are Gibbs sampling, projection, pattern branching, and profile branching. The limitations surrounding them gave an advantage for the selection of the best algorithm in producing an optimized algorithm for the DNA discovery.
VL  - 3
IS  - 4
ER  -

Copy | Download