We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
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

An Efficient Horizontal and Vertical Method for Online DNA Sequence Compression

by Kamta Nath Mishra, Dr. Anupam Aaggarwal, Dr. Edries Abdelhadi, Dr. Prakash C. Srivastava
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 3 - Number 1
Year of Publication: 2010
Authors: Kamta Nath Mishra, Dr. Anupam Aaggarwal, Dr. Edries Abdelhadi, Dr. Prakash C. Srivastava
10.5120/757-954

Kamta Nath Mishra, Dr. Anupam Aaggarwal, Dr. Edries Abdelhadi, Dr. Prakash C. Srivastava . An Efficient Horizontal and Vertical Method for Online DNA Sequence Compression. International Journal of Computer Applications. 3, 1 ( June 2010), 39-46. DOI=10.5120/757-954

@article{ 10.5120/757-954,
author = { Kamta Nath Mishra, Dr. Anupam Aaggarwal, Dr. Edries Abdelhadi, Dr. Prakash C. Srivastava },
title = { An Efficient Horizontal and Vertical Method for Online DNA Sequence Compression },
journal = { International Journal of Computer Applications },
issue_date = { June 2010 },
volume = { 3 },
number = { 1 },
month = { June },
year = { 2010 },
issn = { 0975-8887 },
pages = { 39-46 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume3/number1/757-954/ },
doi = { 10.5120/757-954 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:50:46.488283+05:30
%A Kamta Nath Mishra
%A Dr. Anupam Aaggarwal
%A Dr. Edries Abdelhadi
%A Dr. Prakash C. Srivastava
%T An Efficient Horizontal and Vertical Method for Online DNA Sequence Compression
%J International Journal of Computer Applications
%@ 0975-8887
%V 3
%N 1
%P 39-46
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

DNA matching has become one of the most used biometric identification method during the last several years. DNA stores the information for creating and organizing an organism. It can be thought of as a string over the alphabets {A, C, G, T, N}, which makes four chemical components that make it up. Here, N represents an unknown nucleotide. This unknown nucleotide may be either A, or C, or G, or T. The size of each sequence is varying in the range of millions to billions of nucleotides.

References
Index Terms

Computer Science
Information Sciences

Keywords

DNA Sequence Lossless Compression Horizontal compassion Vertical compression Substitution methods Statistical methods Genome structure

Powered by PhDFocusTM