CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Pairwise Alignment using ABC Optimization

by Ankit Choubey, G. L. Prajapati
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 144 - Number 7
Year of Publication: 2016
Authors: Ankit Choubey, G. L. Prajapati
10.5120/ijca2016910470

Ankit Choubey, G. L. Prajapati . Pairwise Alignment using ABC Optimization. International Journal of Computer Applications. 144, 7 ( Jun 2016), 32-34. DOI=10.5120/ijca2016910470

@article{ 10.5120/ijca2016910470,
author = { Ankit Choubey, G. L. Prajapati },
title = { Pairwise Alignment using ABC Optimization },
journal = { International Journal of Computer Applications },
issue_date = { Jun 2016 },
volume = { 144 },
number = { 7 },
month = { Jun },
year = { 2016 },
issn = { 0975-8887 },
pages = { 32-34 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume144/number7/25194-2016910470/ },
doi = { 10.5120/ijca2016910470 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:47:02.136310+05:30
%A Ankit Choubey
%A G. L. Prajapati
%T Pairwise Alignment using ABC Optimization
%J International Journal of Computer Applications
%@ 0975-8887
%V 144
%N 7
%P 32-34
%D 2016
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In Artificial Bee Colony (ABC) optimization, we find better solution by employing neighbourhood search strategy using the current solutions. Researchers have tested ABC in many practical optimization problems. In this paper, we propose an application of ABC for the pairwise DNA sequence alignment in order to observe its performance in bioinformatics computation. We compare our results with the pairwise alignment algorithm FASTA. The results are encouraging. We also demonstrate ABC on Graph Coloring problem using different traversing strategies.

References
  1. D. Karaboga. An idea based on honey bee swarm for numerical optimization. Techn. Rep. TR06, Erciyes Univ. Press, Erciyes, 2005.
  2. Dervis Karaboga · Bahriye Basturk, “A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm” J Glob Optim (2007), pp 459-471.
  3. A. H. Gebremedhin, “Parallel graph coloring.” PhD Thesis, University of Bergen, Norway, 1999.
  4. D. De Werra, “Heuristics for Graph Coloring Computational Graph Theory.” Comput Suppl, Springer, Vienna 7:19 11-208, 1990.
  5. D. Brelaz, “New methods to color the vertices of a graph.” Commun ACM, 22 (4):251-256, 1979. doi:10.1145/359094.359101
  6. Lipman, DJ; Pearson, WR (1985). "Rapid and sensitive protein similarity searches". Science 227 (4693):1435–41. Doi:10.1126/science.2983426. PMID 2983426.
  7. Mount DM. (2004). Bioinformatics: Sequence and Genome Analysis (2nd Ed.). Cold Spring Harbor Laboratory Press: Cold Spring Harbor, NY. ISBN 0-87969-608-7.
Index Terms

Computer Science
Information Sciences

Keywords

Graph Coloring problem Artificial bee colony optimization DNA pairwise sequence alignment.

Powered by PhDFocusTM