Evaluating the relationship between a generic-based filtering program and DNA sequences
Article
Oluwagbemi, O. and Omonhinmi, C. 2008. Evaluating the relationship between a generic-based filtering program and DNA sequences. Pacific Journal of Science and Technology. 9 (2), pp. 647-657.
Type | Article |
---|---|
Title | Evaluating the relationship between a generic-based filtering program and DNA sequences |
Authors | Oluwagbemi, O. and Omonhinmi, C. |
Abstract | Generic programming depends on the decomposition of programs into simpler components which may be developed separately and combined arbitrarily, subject only to well-defined interfaces. Bioinformatics deals with the application of computational techniques to data present in the Biological sciences. A genetic sequence is a succession of letters which represents the basic structure of a hypothetical DNA molecule, with the capacity to carry information. This research article studied the relationship between the running times of a generic-based filtering program and different samples of genetic sequences in an increasing order of magnitude. A graphical result was obtained to adequately depict this relationship. It was also discovered that the complexity of the generic tree program was O (log 2 N). This research article provided one of the systematic approaches of generic programming to Bioinformatics, which could be instrumental in elucidating major discoveries in Bioinformatics, as regards efficient data management and analysis. |
Sustainable Development Goals | 3 Good health and well-being |
Middlesex University Theme | Health & Wellbeing |
Journal | Pacific Journal of Science and Technology |
ISSN | 1551-7624 |
Publication dates | |
Nov 2008 | |
Publication process dates | |
Accepted | 01 Aug 2008 |
Deposited | 19 Apr 2024 |
Output status | Published |
Language | English |
https://repository.mdx.ac.uk/item/v8q62
25
total views0
total downloads1
views this month0
downloads this month