Title

Authors

Affiliation

Department of Computer Science & Engineering (CSE), Chittagong University of Engineering & Technology (CUET), Chittagong - 4349, Bangladesh

Email

chotan_cuetcse03@yahoo.com; *Corresponding author

Article Type

Prediction model

Date

Received August 26, 2013; Accepted September 01, 2013; Published September 23, 2013

Storage of sequence data is a big concern as the amount of data generated is exponential in nature at several locations. Therefore, there is a need to develop techniques to store data using compression algorithm. Here we describe optimal storage algorithm (OPTSDNA) for storing large amount of DNA sequences of varying length. This paper provides performance analysis of optimal storage algorithm (OPTSDNA) of a distributed bioinformatics computing system for analysis of DNA sequences. OPTSDNA algorithm is used for storing various sizes of DNA sequences into database. DNA sequences of different lengths were stored by using this algorithm. These input DNA sequences are varied in size from very small to very large. Storage size is calculated by this algorithm. Response time is also calculated in this work. The efficiency and performance of the algorithm is high ( in size calculation with percentage) when compared with other known with sequential approach.

Keywords

Distributed Bioinformatics System, DNA Sequence, Optimal Storage, Sequential Approach, Performance Measurement.

Citation

Khan & Sheel,  Bioinformation 9(16): 842-846 (2013)

Edited by

P Kangueane

ISSN

0973-2063

Publisher

Biomedical Informatics

License

This is an Open Access article which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly credited. This is distributed under the terms of the Creative Commons Attribution License.