Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Discovering simple DNA sequences by compression

D R Powell1, D L Dowe, L Allison

  • 1Department of Computer Science, Monash University, Clayton, Vic., Australia. powell@cs.monash.edu.au

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing
|August 11, 1998
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

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

Sort by
Same author

Bacteriological Survey of Fresh Minced Beef on Sale at Retail Outlets in Scotland in 2019: Three Foodborne Pathogens, Hygiene Process Indicators, and Phenotypic Antimicrobial Resistance.

Journal of food protection·2022
Same author

Detailed hair shaft analysis in a man with delayed-onset Chediak-Higashi syndrome.

The British journal of dermatology·2019
Same author

Outbreak of Escherichia coli O157 Phage Type 32 linked to the consumption of venison products.

Epidemiology and infection·2018
Same author

Galactic Cosmic Radiation Induces Persistent Epigenome Alterations Relevant to Human Lung Cancer.

Scientific reports·2018
Same author

Over or under: hydride attack at the metal versus the coordinated nitrosyl ligand in ferric nitrosyl porphyrins.

Dalton transactions (Cambridge, England : 2003)·2016
Same author

Dentin Dysplasia in Notum Knockout Mice.

Veterinary pathology·2016
Same journal

Trust, Reproducibility, and Progress: The Roles of Independent Blind Prediction and Assessment and Benchmarking in Computational Biology.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2026
Same journal

The Evolving Cyberinfrastructure at the National Institutes of Health to Support Data and AI in Biomedical Research.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2026
Same journal

Applications of AI & ML in Biomanufacturing of Cell and Gene Therapies.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2026
Same journal

AI for Health: Leveraging Artificial Intelligence to Revolutionize Healthcare.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2026
Same journal

Workshop Introduction: Advances of AI Methods in Single Cell Spatial Omics.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2026
Same journal

DRIVE-KG: Enhancing variant-phenotype association discovery in understudied complex diseases using heterogeneous knowledge graphs.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2026
See all related articles

This study refines an information-theoretic DNA compression method, improving its efficiency for gene discovery and DNA sequence compression. The enhanced scheme offers faster processing, with some methods achieving linear time complexity.

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • The Milosavljevic and Jurka (1993) information-theoretic DNA compression scheme, utilizing run-length encoding with specific codewords, has been widely applied in gene discovery and DNA compression.
  • This existing scheme employs five codewords (A, C, G, T, and a pointer to previous runs) and specific codeword lengths for sequence encoding, including start and end markers.

Purpose of the Study:

  • To identify and demonstrate the inefficiencies within the established Milosavljevic and Jurka DNA compression scheme.
  • To develop and present an improved information-theoretic DNA compression method that enhances efficiency and performance.
  • To explore and discuss the implementation of various optimized DNA compression schemes, including those with linear time complexity.

Main Methods:

Related Experiment Videos

  • Analysis of the existing information-theoretic DNA compression scheme to pinpoint areas of inefficiency.
  • Development of a novel, more efficient DNA compression algorithm based on information-theoretic principles.
  • Implementation and evaluation of various compression schemes, focusing on performance and time complexity, including linear-time approaches.

Main Results:

  • The study demonstrates that the original Milosavljevic and Jurka DNA compression scheme exhibits several inefficiencies.
  • An improved compression scheme has been developed, offering enhanced efficiency for DNA compression.
  • Implementation results show that some of the newly developed schemes achieve linear time complexity, significantly improving processing speed.

Conclusions:

  • The original information-theoretic DNA compression scheme has inherent inefficiencies that limit its optimal application.
  • The proposed improvements lead to a more efficient DNA compression method suitable for gene discovery and sequence analysis.
  • The development of linear-time DNA compression algorithms represents a significant advancement in computational biology.