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 Concept Videos

Modern Molecular Taxonomy01:29

Modern Molecular Taxonomy

828
Advancements in molecular biology have revolutionized the identification and characterization of bacteria, with multiple methods leveraging DNA sequencing for enhanced precision. As sequencing technologies improve and costs decline, these approaches are increasingly used in clinical, environmental, and evolutionary studies.Multilocus Sequence Typing (MLST) examines several housekeeping genes, essential chromosomal genes encoding cellular functions, to distinguish strains. Approximately...
828
Evolutionary Relationships through Genome Comparisons02:54

Evolutionary Relationships through Genome Comparisons

5.8K
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...
5.8K

You might also read

Related Articles

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

Sort by
Same author

A parallel and incremental algorithm for efficient unique signature discovery on DNA databases.

BMC bioinformatics·2010
See all related articles

Related Experiment Video

Updated: Apr 23, 2026

Application of DNA Fingerprinting using the D1S80 Locus in Lab Classes
08:35

Application of DNA Fingerprinting using the D1S80 Locus in Lab Classes

Published on: July 17, 2021

22.4K

An algorithm of discovering signatures from DNA databases on a computer cluster.

Hsiao Ping Lee, Tzu-Fang Sheu1

  • 1Department of Computer Science and Communication Engineering, Providence University, 200, Sec, 7, Taiwan Boulevard, 43301 Shalu Dist,, Taichung, Taiwan. fang@pu.edu.tw.

BMC Bioinformatics
|October 6, 2014
PubMed
Summary

A new parallel signature discovery algorithm uses a divide-and-conquer strategy to efficiently process large genomic databases. This method overcomes memory limitations of previous algorithms, enabling rapid signature identification for applications like Next Generation Sequencing.

More Related Videos

Detection of Rare Mutations in CtDNA Using Next Generation Sequencing
11:11

Detection of Rare Mutations in CtDNA Using Next Generation Sequencing

Published on: August 24, 2017

15.0K
Rare Event Detection Using Error-corrected DNA and RNA Sequencing
10:36

Rare Event Detection Using Error-corrected DNA and RNA Sequencing

Published on: August 3, 2018

14.6K

Related Experiment Videos

Last Updated: Apr 23, 2026

Application of DNA Fingerprinting using the D1S80 Locus in Lab Classes
08:35

Application of DNA Fingerprinting using the D1S80 Locus in Lab Classes

Published on: July 17, 2021

22.4K
Detection of Rare Mutations in CtDNA Using Next Generation Sequencing
11:11

Detection of Rare Mutations in CtDNA Using Next Generation Sequencing

Published on: August 24, 2017

15.0K
Rare Event Detection Using Error-corrected DNA and RNA Sequencing
10:36

Rare Event Detection Using Error-corrected DNA and RNA Sequencing

Published on: August 3, 2018

14.6K

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • Signature discovery is crucial for species identification.
  • Existing algorithms struggle with large datasets due to memory limitations.
  • Current methods are inefficient, necessitating improved discovery speeds.

Purpose of the Study:

  • To develop a novel signature discovery algorithm.
  • To overcome memory constraints of existing signature discovery methods.
  • To enhance the efficiency and speed of signature discovery.

Main Methods:

  • Implementation of a divide-and-conquer strategy for signature discovery.
  • Development of a parallel signature discovery algorithm utilizing a computer cluster.
  • Adaptation of the algorithm for execution on standard personal computer memory.

Main Results:

  • The proposed algorithm successfully processes large databases previously unmanageable by existing methods.
  • Demonstrated ability to handle databases like the human whole-genome EST database.
  • Significant improvement in the efficiency of signature discovery through parallel computing.

Conclusions:

  • The new algorithm is not memory-bound, allowing rapid signature identification in large databases.
  • Applicable to Next Generation Sequencing and other large-scale data analysis.
  • The implementation is publicly available for use.