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

Maxam-Gilbert Sequencing

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

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

Sequences

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

Convergence of Sequences

Convergence of Sequences

A sequence is a function defined on the natural numbers that assigns a value to each index. It can be understood as an ordered list of terms generated one after another. In mathematical analysis, an important question is whether the terms of a sequence approach a single real number as the index becomes very large. When this happens, the sequence is said to converge, and the value approached is called the limit. From a graphical perspective, convergence means that the plotted terms approach a...

Sequence Networks of Rotating Machines

Sequence Networks of Rotating Machines

A Y-connected synchronous generator, grounded through a neutral impedance, is designed to produce balanced internal phase voltages with only positive-sequence components. The generator's sequence networks include a source voltage that is exclusively in the positive-sequence network. The sequence components of line-to-ground voltages at the generator terminals illustrate this configuration.
Zero-sequence current induces a voltage drop across the generator's neutral impedance and other...

Statically Indeterminate Problem Solving

Statically Indeterminate Problem Solving

Statically indeterminate problems are those where statics alone can not determine the internal forces or reactions. Consider a structure comprising two cylindrical rods made of steel and brass. These rods are joined at point B and restrained by rigid supports at points A and C. Now, the reactions at points A and C and the deflection at point B are to be determined. This rod structure is classified as statically indeterminate as the structure has more supports than are necessary for maintaining...

You might also read

Related Articles

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

Sort by

Same author

UniversalEPI: robust prediction of cell type-specific and differential chromatin interactions from DNA sequence and chromatin accessibility.

Nucleic acids research·2026

Same author

From single DNA molecule to nanoparticle formation: mechanistic basis for monocationic aromatic drug-induced DNA frameworks.

Journal of nanobiotechnology·2026

Same author

Author Correction: Single-cell atlas of the transcriptome and chromatin accessibility in the human retina.

Nature genetics·2026

Same author

Single-cell atlas of the transcriptome and chromatin accessibility in the human retina.

Nature genetics·2026

Same author

Mechanical characterization of intermediates of Ag+-DNA complex: An atomic force study.

The Journal of chemical physics·2025

Same author

Internalization of external tau aggregates co-localize with early endocytic markers and lysosomes.

Biophysical chemistry·2025

Same journal

MCFST: Spatial domain identification method based on multi-view graph convolutional network and graph fusion network.

Bioinformatics (Oxford, England)·2026

Same journal

SpaBiT: Enhancing Spatial Transcriptomics Resolution via Bidirectional Attention Transformers.

Bioinformatics (Oxford, England)·2026

Same journal

EDEL: Enhancing Dense Retrievers for Curation of Biomedical Knowledge Bases.

Bioinformatics (Oxford, England)·2026

Same journal

Informative Relational Learning for Adverse Reaction Prediction with Enhanced Generalization to Novel Drugs.

Bioinformatics (Oxford, England)·2026

Same journal

An interpretable deep learning framework uncovers features governing CRISPR-Cas9 genome-editing efficiency.

Bioinformatics (Oxford, England)·2026

Same journal

3DICE: Interpretable 3D Cross-Modal Learning for Drug-Target Interaction Prediction and Large-Scale Drug Discovery.

Bioinformatics (Oxford, England)·2026

See all related articles

Search research articles

Related Experiment Video

Updated: Jun 13, 2026

A Practical Guide to Phylogenetics for Nonexperts

A Practical Guide to Phylogenetics for Nonexperts

Published on: February 5, 2014

Interactive software tool to comprehend the calculation of optimal sequence alignments with dynamic programming.

Ignacio L Ibarra¹, Francisco Melo

¹Laboratorio de Bioinformática Molecular, Departamento de Genética Molecular y Microbiología, Facultad de Ciencias Biológicas, Pontificia Universidad Católica de Chile, Alameda 340, Santiago, Chile.

Bioinformatics (Oxford, England)

|May 18, 2010

Summary

This summary is machine-generated.

This study introduces an interactive software tool to help students learn the dynamic programming (DP) algorithm, commonly used in bioinformatics for sequence alignment. The application visualizes the DP scoring matrix and alignments, aiding education in computational biology.

More Related Videos

Protein WISDOM: A Workbench for In silico De novo Design of BioMolecules

Protein WISDOM: A Workbench for In silico De novo Design of BioMolecules

Published on: July 25, 2013

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

Related Experiment Videos

Last Updated: Jun 13, 2026

A Practical Guide to Phylogenetics for Nonexperts

A Practical Guide to Phylogenetics for Nonexperts

Published on: February 5, 2014

Protein WISDOM: A Workbench for In silico De novo Design of BioMolecules

Protein WISDOM: A Workbench for In silico De novo Design of BioMolecules

Published on: July 25, 2013

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

Area of Science:

Bioinformatics and Computational Biology
Algorithm Development and Optimization

Background:

Dynamic programming (DP) is a crucial optimization strategy widely applied in bioinformatics for sequence alignment.
Existing educational resources lack interactive tools for understanding the DP algorithm in sequence alignment.

Purpose of the Study:

To develop an interactive computer application with a graphical interface for educating students on the dynamic programming algorithm.
To provide a tool for visualizing DP scoring matrices and optimal sequence alignments.

Main Methods:

Developed a user-friendly software application with a graphical interface.
The software allows modification of key parameters, including similarity matrix values, alignment algorithm versions, and gap penalties.
Implemented in Java for cross-platform compatibility (Windows, Mac OS X, Linux).

Main Results:

The application successfully displays the dynamic programming scoring matrix and the resulting optimal alignment(s).
Users can interactively modify parameters to explore their impact on sequence alignment outcomes.

Conclusions:

The developed interactive software serves as a valuable educational tool for understanding the dynamic programming algorithm in bioinformatics.
It is expected to benefit students and educators in bioinformatics courses and researchers utilizing DP for sequence analysis.