Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Evolutionary Relationships through Genome Comparisons

Evolutionary Relationships through Genome Comparisons

Genome comparison is one of the excellent ways to interpret the evolutionary relationships between organisms. The basic principle of genome comparison is that if two species share a common feature, it is likely encoded by the DNA sequence conserved between both species. The advent of genome sequencing technologies in the late 20th century enabled scientists to understand the concept of conservation of domains between species and helped them to deduce evolutionary relationships across diverse...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by

Same author

Image Defogging Framework Using Segmentation and the Dark Channel Prior.

Entropy (Basel, Switzerland)·2021

Same author

Use Of Steroids In Rhinoplasty With Lateral Osteotomies For Reducing Post Operative Oedema.

Journal of Ayub Medical College, Abbottabad : JAMC·2018

Same author

Hidden Markov model and Chapman Kolmogrov for protein structures prediction from images.

Computational biology and chemistry·2017

Same author

MSuPDA: A Memory Efficient Algorithm for Sequence Alignment.

Interdisciplinary sciences, computational life sciences·2015

Same author

Performance evaluation of Warshall algorithm and dynamic programming for Markov chain in local sequence alignment.

Interdisciplinary sciences, computational life sciences·2014

Search research articles

Related Experiment Video

Updated: May 6, 2026

A Bioinformatics Pipeline for Investigating Molecular Evolution and Gene Expression using RNA-seq

A Bioinformatics Pipeline for Investigating Molecular Evolution and Gene Expression using RNA-seq

Published on: May 28, 2021

OPTSDNA: Performance evaluation of an efficient distributed bioinformatics system for DNA sequence analysis.

Mohammad Ibrahim Khan¹, Chotan Sheel

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

|October 22, 2013

Summary

Storing large DNA sequence data is challenging. The Optimal Storage Algorithm (OPTSDNA) offers an efficient solution for compressing and storing diverse DNA sequences, outperforming sequential methods.

Keywords:

DNA Sequence Distributed Bioinformatics System Optimal Storage Performance Measurement Sequential Approach

More Related Videos

Informatic Analysis of Sequence Data from Batch Yeast 2-Hybrid Screens

Informatic Analysis of Sequence Data from Batch Yeast 2-Hybrid Screens

Published on: June 28, 2018

Author Spotlight: Cost-Effective Transcriptomic Drug Screening - Unlocking New Targets

Author Spotlight: Cost-Effective Transcriptomic Drug Screening - Unlocking New Targets

Published on: February 23, 2024

Related Experiment Videos

Last Updated: May 6, 2026

A Bioinformatics Pipeline for Investigating Molecular Evolution and Gene Expression using RNA-seq

A Bioinformatics Pipeline for Investigating Molecular Evolution and Gene Expression using RNA-seq

Published on: May 28, 2021

Informatic Analysis of Sequence Data from Batch Yeast 2-Hybrid Screens

Informatic Analysis of Sequence Data from Batch Yeast 2-Hybrid Screens

Published on: June 28, 2018

Author Spotlight: Cost-Effective Transcriptomic Drug Screening - Unlocking New Targets

Author Spotlight: Cost-Effective Transcriptomic Drug Screening - Unlocking New Targets

Published on: February 23, 2024

Area of Science:

Bioinformatics
Computational Biology
Data Science

Background:

Exponential growth of sequence data presents significant storage challenges.
Efficient data compression and storage are crucial for bioinformatics.
Existing methods may not optimally handle DNA sequences of varying lengths.

Purpose of the Study:

To introduce and analyze the Optimal Storage Algorithm (OPTSDNA) for DNA sequence data.
To evaluate the performance of OPTSDNA in a distributed computing environment.
To assess the algorithm's effectiveness in storing DNA sequences of diverse sizes.

Main Methods:

Development of the Optimal Storage Algorithm (OPTSDNA).
Implementation of OPTSDNA for storing DNA sequences of various lengths.
Performance analysis including storage size calculation and response time.
Comparison with sequential storage approaches.

Main Results:

OPTSDNA effectively stores DNA sequences ranging from small to very large.
The algorithm provides accurate storage size calculations.
Performance analysis indicates high efficiency and effectiveness compared to sequential methods.
Response time was also evaluated.

Conclusions:

OPTSDNA is a highly efficient algorithm for storing large volumes of DNA sequence data.
The algorithm demonstrates superior performance over traditional sequential approaches.
OPTSDNA provides a viable solution for managing the growing demands of sequence data storage in bioinformatics.