CFP last date
22 April 2024
Reseach Article

A Note on Bioinformatics using Genetic Algorithms

by Dinesh Prasad Sahu, Mohammad Sajid, Shiv Prakash
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 117 - Number 1
Year of Publication: 2015
Authors: Dinesh Prasad Sahu, Mohammad Sajid, Shiv Prakash
10.5120/20519-2315

Dinesh Prasad Sahu, Mohammad Sajid, Shiv Prakash . A Note on Bioinformatics using Genetic Algorithms. International Journal of Computer Applications. 117, 1 ( May 2015), 23-24. DOI=10.5120/20519-2315

@article{ 10.5120/20519-2315,
author = { Dinesh Prasad Sahu, Mohammad Sajid, Shiv Prakash },
title = { A Note on Bioinformatics using Genetic Algorithms },
journal = { International Journal of Computer Applications },
issue_date = { May 2015 },
volume = { 117 },
number = { 1 },
month = { May },
year = { 2015 },
issn = { 0975-8887 },
pages = { 23-24 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume117/number1/20519-2315/ },
doi = { 10.5120/20519-2315 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:58:09.178908+05:30
%A Dinesh Prasad Sahu
%A Mohammad Sajid
%A Shiv Prakash
%T A Note on Bioinformatics using Genetic Algorithms
%J International Journal of Computer Applications
%@ 0975-8887
%V 117
%N 1
%P 23-24
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The Bioinformatics (BI) is a sequence alignment, usually three sequences which can be RNA, DNA and proteins. Because the three or more given sequences can be of large lengths, aligning them by hand can be time consuming and in some cases traditionally impossible. Thus BI comes into use thereby aligning each sequence, and revealing the similar part of the given gene. BI finds great use in bioinformatics where it is used to predict the protein structure, its function, family or its domain. These problems are related to AI and can be classified in the NP complete domain of problems. Thus with the goal of identifying maximum similarities among the sequences, we can use various approaches and techniques like Genetic Algorithms (GA) and its variant in BI.

References
  1. Chintapalli, R., Kumar A., Parayitam, L., “Bioinformaticsa quick tour”, ICACT 2013, India, 21 September 2013.
  2. Fa Zhang, Xiang-Zhen Qiao, Zhi Yong Liu, ”A parallel Smith waterman algorithm based on divide and conquer”, Algorithms and architectures for parallel processing, China, 25 October 2002.
  3. Ozer B, Gezici G, Meydan C, Sezerman U, “Bioinformaticsusing structural properties”, HIBIT 2010, Antalya,20 April 2010.
  4. Needleman, Saul B, Wunsch, Christian D, "A general method applicable to the search for similarities in the amino acid sequence of two proteins", Journal of Molecular Biology.
  5. Hamidi S, Naghibzadeh M, Sadri J, “Protein Bioinformaticsbased on secondary structure similarity”, ICACCI 2013, Mysore, 25 august 2013.
  6. C. Kumar, S. Prakash, T. Kumar and D. P. Sahu, “Variant of genetic algorithm and its applications”, International Journal of Artificial Intelligence and Neural Networks, vol. 4(4), pp. 8-12, 2014.
  7. D.P. Sahu, K. Singh, S. Prakash, “Maximizing Availability and Minimizing Markesan for Task Scheduling in Grid Computing using NSGA II”, 2nd International conference for computer and communication technology, LNCS, Springer, 1-6, 2015.
  8. D.P. Sahu, K. Singh, S. Prakash, “Task Scheduling in Grid Computing using NSGA II”, 2nd International conference fo networking, information and communication technology, SVCE, Vidyanagar, Bangalore-562157, India, IEEE, 1-3, 2015.
  9. D.P. Sahu, K. Singh, S. Prakash, “Resource Allocation and Provisioning in Computational Mobile Grid”, International Journal of Applied Evolutionary Computation, vol. 6(2), pp. 57-83, 2015.
Index Terms

Computer Science
Information Sciences

Keywords

Bioinformatics Alignment NP complete GA