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

DNA Isolation01:24

DNA Isolation

DNA isolation protocols can be fast and straightforward or complex and time-consuming depending on the type and quality of DNA required for further processing. For example, plasmid DNA extraction is a bit more complicated than genomic DNA extraction because of the need for an appropriate lysis method to separate plasmid DNA from gDNA during isolation. However, for specific applications, such as long-range DNA sequencing that require a good yield of high- quality DNA samples, we need to follow...
Sanger Sequencing01:57

Sanger Sequencing

DNA sequencing is a fundamental technique that is routinely used in the biological sciences. This method can be applied to a range of questions at different scales - from the sequencing of a cloned DNA fragment or the study of a mutation in a gene up to whole-genome sequencing. However, despite the widespread use of sequencing today, it was not until 1977 that Fredrick Sanger and his collaborators developed the chain-termination method to decode DNA sequences. It relies on the separation of a...
Next-generation Sequencing03:00

Next-generation Sequencing

The first human genome sequencing project cost $2.7 billion and was declared complete in 2003, after 15 years of international cooperation and collaboration between several research teams and funding agencies. Today, with the advent of next-generation sequencing technologies, the cost and time of sequencing a human genome have dropped over 100 fold.
Next-Generation Sequencing Methods
Although all next-generation methods use different technologies, they all share a set of standard features.

You might also read

Related Articles

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

Sort by
Same author

Clover: a clustering-oriented de novo assembler for Illumina sequences.

BMC bioinformatics·2020
Same author

Hadoop-MCC: Efficient Multiple Compound Comparison Algorithm Using Hadoop.

Combinatorial chemistry & high throughput screening·2018
Same author

MGUPGMA: A Fast UPGMA Algorithm With Multiple Graphics Processing Units Using NCCL.

Evolutionary bioinformatics online·2017
Same author

Bacterial diversity among four healthcare-associated institutes in Taiwan.

Scientific reports·2017
Same author

Prevalence and comparative analysis of the type IV secretion system in Aggregatibacter actinomycetemcomitan.

Journal of microbiology, immunology, and infection = Wei mian yu gan ran za zhi·2017
Same author

Subgingival microbiota in individuals with severe chronic periodontitis.

Journal of microbiology, immunology, and infection = Wei mian yu gan ran za zhi·2016
Same journal

OpenIMC: an open-source platform for analyzing single-cell and spatial proteomics by imaging mass cytometry.

BMC bioinformatics·2026
Same journal

NAP: an open source pipeline for cross-domain microbiome profiling using Nanopore sequencing-derived amplicon data.

BMC bioinformatics·2026
Same journal

SurvGME: an R package for survival analysis with graphical and measurement error models.

BMC bioinformatics·2026
Same journal

SimMapNet: a Bayesian framework for gene regulatory network inference using gene ontology similarities as external hint.

BMC bioinformatics·2026
Same journal

Dual channel drug-drug interactions extraction based on cross attention.

BMC bioinformatics·2026
Same journal

FeSseqdb: a curated sequence-level database and interpretable machine learning framework for identifying iron-sulfur proteins.

BMC bioinformatics·2026
See all related articles

Related Experiment Video

Updated: Jun 15, 2026

DNAzyme 10-23 - Based Nanomachines for Nucleic Acid Recognition
07:16

DNAzyme 10-23 - Based Nanomachines for Nucleic Acid Recognition

Published on: February 9, 2024

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

Hsiao Ping Lee1, Tzu-Fang Sheu, Chuan Yi Tang

  • 1Department of Computer Science and Communication Engineering, Providence University, Taichung, 43301 Taiwan, ROC.

BMC Bioinformatics
|March 17, 2010
PubMed
Summary
This summary is machine-generated.

This study introduces new algorithms for efficiently discovering implicit DNA signatures. These methods reduce computational time, improving signature discovery for applications like PCR and microarrays.

More Related Videos

DNA Sequence Recognition by DNA Primase Using High-Throughput Primase Profiling
08:04

DNA Sequence Recognition by DNA Primase Using High-Throughput Primase Profiling

Published on: October 8, 2019

A High-Throughput Enzyme-Coupled Activity Assay to Probe Small Molecule Interaction with the dNTPase SAMHD1
08:17

A High-Throughput Enzyme-Coupled Activity Assay to Probe Small Molecule Interaction with the dNTPase SAMHD1

Published on: April 16, 2021

Related Experiment Videos

Last Updated: Jun 15, 2026

DNAzyme 10-23 - Based Nanomachines for Nucleic Acid Recognition
07:16

DNAzyme 10-23 - Based Nanomachines for Nucleic Acid Recognition

Published on: February 9, 2024

DNA Sequence Recognition by DNA Primase Using High-Throughput Primase Profiling
08:04

DNA Sequence Recognition by DNA Primase Using High-Throughput Primase Profiling

Published on: October 8, 2019

A High-Throughput Enzyme-Coupled Activity Assay to Probe Small Molecule Interaction with the dNTPase SAMHD1
08:17

A High-Throughput Enzyme-Coupled Activity Assay to Probe Small Molecule Interaction with the dNTPase SAMHD1

Published on: April 16, 2021

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • DNA signatures are crucial for molecular biology applications like PCR primer design and microarrays.
  • Current DNA signature discovery algorithms require manual tuning of parameters (length, mismatch tolerance), leading to inefficient trial-and-error processes.
  • Implicit signatures, defined by length and mismatch criteria, are not fully addressed by existing discovery methods.

Purpose of the Study:

  • To develop efficient algorithms for discovering all implicit DNA signatures.
  • To overcome the limitations of existing trial-and-error approaches for signature discovery.

Main Methods:

  • Proposed the Parallel and Incremental Signature Discovery (PISD) algorithm for efficient signature discovery.
  • Developed the Consecutive Multiple Discovery (CMD) algorithm, utilizing PISD as a core component to find implicit signatures under various conditions.
  • PISD enhances efficiency by reusing prior results and employing parallel computing.

Main Results:

  • The PISD algorithm discovers signatures by leveraging previously found results, avoiding redundant database scans.
  • The CMD algorithm efficiently identifies implicit signatures across all feasible discovery conditions.
  • Experimental results show significant efficiency gains compared to traditional methods.

Conclusions:

  • The proposed CMD and PISD algorithms enable efficient discovery of implicit DNA signatures.
  • The CMD algorithm demonstrated up to a 97% reduction in execution time compared to sequential algorithms when using eight processing cores.