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

Maxam-Gilbert Sequencing01:05

Maxam-Gilbert Sequencing

In the same year as the discovery of the Sanger sequencing method, another group of scientists, Allan Maxam and Walter Gilbert, demonstrated their chemical-cleavage method for DNA sequencing. The Maxam-Gilbert method relies on using different chemicals that can cleave the DNA sequence at specific sites, the separation of resulting DNA fragments of variable size using electrophoresis, and deciphering the DNA sequence from the resulting gel bands.
Challenges of the Maxam-Gilbert Method
The...
Multi-species Conserved Sequences02:51

Multi-species Conserved Sequences

Next-generation sequencing technologies have created large genomic databases of a variety of animals and plants. Ever since the human genome project was completed, scientists studied the genome of primates, mammals, and other phylogenetically distant living beings. Such large-scale  studies have provided new insights into the evolutionary relationship between organisms.
Although the genome of each species varies greatly from each other, a few sequences are highly conserved. Such conserved DNA...
Per-Unit Sequence Models01:26

Per-Unit Sequence Models

An ideal Y-Y transformer, grounded through neutral impedances, displays per-unit sequence networks akin to those of a single-phase ideal transformer when subjected to balanced positive- or negative-sequence currents. These currents do not produce neutral currents, and their associated voltage drops.
Zero-sequence currents, which are identical in magnitude and phase, generate a neutral current, resulting in voltage drops across the neutral impedance and the low-voltage winding. If the...
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.
Evolutionary Relationships through Genome Comparisons02:54

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...
Sequences01:29

Sequences

Sequences are fundamental mathematical objects consisting of ordered lists of numbers that follow a specific rule or pattern. Sequences are critical in various mathematical concepts, including calculus, series, and number theory. They can model real-world phenomena such as population growth, financial investments, and physical processes like the diminishing height of a bouncing ball.Each number in a sequence is referred to as a term. Typically, the terms are denoted as a1, a2, a3,…, where the...

You might also read

Related Articles

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

Sort by
Same author

Focused active learning for histopathological image classification.

Medical image analysis·2024
Same author

Computational de novo discovery of distinguishing genes for biological processes and cell types in complex tissues.

PloS one·2018
Same author

Phyloscan: locating transcription-regulating binding sites in mixed aligned and unaligned sequence data.

Nucleic acids research·2010
Same author

Error statistics of hidden Markov model and hidden Boltzmann model results.

BMC bioinformatics·2009
Same author

Exact calculation of distributions on integers, with application to sequence alignment.

Journal of computational biology : a journal of computational molecular cell biology·2009
Same author

Significance of gapped sequence alignments.

Journal of computational biology : a journal of computational molecular cell biology·2008

Related Experiment Video

Updated: Jul 4, 2026

A Practical Guide to Phylogenetics for Nonexperts
12:00

A Practical Guide to Phylogenetics for Nonexperts

Published on: February 5, 2014

Memory-efficient dynamic programming backtrace and pairwise local sequence alignment.

Lee A Newberg1

  • 1New York State Department of Health, Center for Bioinformatics, Wadsworth Center, Albany, NY 12208-3425, USA. leen@cs.rpi.edu

Bioinformatics (Oxford, England)
|June 19, 2008
PubMed
Summary

This study introduces an optimal checkpointing strategy for dynamic programming algorithms in computational biology. The method efficiently reconstructs paths when memory is limited, improving sequence alignment performance.

More Related Videos

Demonstration of the Sequence Alignment to Predict Across Species Susceptibility Tool for Rapid Assessment of Protein Conservation
16:02

Demonstration of the Sequence Alignment to Predict Across Species Susceptibility Tool for Rapid Assessment of Protein Conservation

Published on: February 10, 2023

Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues
07:08

Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues

Published on: July 14, 2015

Related Experiment Videos

Last Updated: Jul 4, 2026

A Practical Guide to Phylogenetics for Nonexperts
12:00

A Practical Guide to Phylogenetics for Nonexperts

Published on: February 5, 2014

Demonstration of the Sequence Alignment to Predict Across Species Susceptibility Tool for Rapid Assessment of Protein Conservation
16:02

Demonstration of the Sequence Alignment to Predict Across Species Susceptibility Tool for Rapid Assessment of Protein Conservation

Published on: February 10, 2023

Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues
07:08

Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues

Published on: July 14, 2015

Area of Science:

  • Computational Biology
  • Bioinformatics
  • Algorithm Optimization

Background:

  • Backtracing dynamic programming results is crucial for computational biology tasks like finding optimal paths or sequence alignment.
  • Limited high-speed memory necessitates storing only selected computation stages and recomputing missing data from checkpoints.

Purpose of the Study:

  • To present an optimal checkpointing strategy for dynamic programming algorithms.
  • To demonstrate the strategy's effectiveness in memory-constrained environments.

Main Methods:

  • Developed an optimal checkpointing strategy for dynamic programming algorithms.
  • Applied and validated the strategy using pairwise local sequence alignment.

Main Results:

  • The optimal checkpointing strategy was successfully demonstrated.
  • The method proved effective for aligning long sequences (10,000 length).

Conclusions:

  • The proposed optimal checkpointing strategy is a valuable tool for computational biology.
  • This approach enhances the efficiency of dynamic programming tasks, particularly sequence alignment, under memory constraints.