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

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Algorithm for Protein Sequence Analysis

Published on October 2011 by Krishna Bikram Shah, Samarjeet Borah
journal_cover_thumbnail

International Symposium on Devices MEMS, Intelligent Systems & Communication
Foundation of Computer Science USA
ISDMISC - Number 8
October 2011
Authors: Krishna Bikram Shah, Samarjeet Borah
919273d8-f5d9-4edf-8362-4753873d0e1a

Krishna Bikram Shah, Samarjeet Borah . Algorithm for Protein Sequence Analysis. International Symposium on Devices MEMS, Intelligent Systems & Communication. ISDMISC, 8 (October 2011), 31-35.

@article{
author = { Krishna Bikram Shah, Samarjeet Borah },
title = { Algorithm for Protein Sequence Analysis },
journal = { International Symposium on Devices MEMS, Intelligent Systems & Communication },
issue_date = { October 2011 },
volume = { ISDMISC },
number = { 8 },
month = { October },
year = { 2011 },
issn = 0975-8887,
pages = { 31-35 },
numpages = 5,
url = { /proceedings/isdmisc/number8/3777-isdm173/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 International Symposium on Devices MEMS, Intelligent Systems & Communication
%A Krishna Bikram Shah
%A Samarjeet Borah
%T Algorithm for Protein Sequence Analysis
%J International Symposium on Devices MEMS, Intelligent Systems & Communication
%@ 0975-8887
%V ISDMISC
%N 8
%P 31-35
%D 2011
%I International Journal of Computer Applications
Abstract

When comparing two sequences to identify similarities and differences between them, generally, a measure of how similar they are is also desirable. Similar sequences probably have the same ancestor, share the same structure, and have a similar biological function. A typical approach to solve this problem is to find a good and reasonable alignment between the two sequences. Then, given an appropriate scoring scheme, their similarity can be computed. This study describes the concepts, tools and implementation of selected algorithms being used for sequence analysis.

References
  1. [<ol> Text available (online): http://en.wikipedia.org/wiki/ sequence_ analysis Image available (online): http://www.apimba.org.php Hassan Mathkour and Muneer Ahmad, Genome Sequence Analysis, A Survey, Journal of Computer Science. Maxime Crochemore, Sequence Alignment Algorithms, Kings College, London Krishna Bikram Shah and Samarjeet Borah, “Protein Sequence Aaalysis, A Study on Recent Developement”, ISBN 978-1-4244-9241-1, IEEE CPF1197F-PRT, Pg. 506-510 Text available (online) http://www.wekipedia.com. Zhinua Du and Feng Lin, Improvement of the Needleman-Wunsch Algorithm, 2004, Volume 3066/2004, 792-797 Smith TF and Waterman MS, Identification of Common Molecular Subsequences, J. Mol. Biol. (1981) 147, 195-197 Text available (online): www.ebi.ac.uk/fasta33 Text available (online): www.ncbi.nlm.nih.gov/BLAST Result from http://www.ebi.ac.uk/Tools/emboss/align/ </ol>]
Index Terms

Computer Science
Information Sciences

Keywords

Genome DNA adenosine cytosine guanine thymine