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

Multi-species Conserved Sequences

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

Per-Unit Sequence Models

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

Conservation of Protein Domains Over Different Proteins

Conservation of Protein Domains Over Different Proteins

Protein domains are small structurally independent units that are part of a single amino acid chain. Although these domains are often structurally independent, they may rely on synergistic effects to perform their functions as part of a larger protein. Protein domains may be conserved within the same organism, as well as across different organisms.
A limited set of protein domains often duplicate and recombine during evolution. These domains can be organized in different combinations to...

Routh-Hurwitz Criterion II

Routh-Hurwitz Criterion II

In the application of the Routh-Hurwitz criterion, two specific scenarios can arise that complicate stability analysis.
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first...

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

Conservation of Protein Domains

Conservation of Protein Domains

You might also read

Related Articles

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

Sort by

Same author

Clinical significance of genetic mutations in adult patients with focal segmental glomerulosclerosis.

Kidney research and clinical practice·2026

Same author

Network-informed multi-trait genomic analysis decodes the shared genetic architecture and therapeutic landscape of pelvic floor disorders.

npj aging·2026

Same author

Synthesis of functionalized hydrosilanes via titanium-catalyzed hydroboration and hydrogenation of C(sp<sup>3</sup>)-Si bonds in silacyclobutanes.

Nature communications·2026

Same author

Multimodal Distillation and Fusion for Enhanced Age-Related Macular Degeneration Classification.

IEEE journal of biomedical and health informatics·2026

Same author

Prompt mechanisms in medical imaging: A comprehensive survey.

Innovation (Cambridge (Mass.))·2026

Same author

Multifunctional gelatin-based sustainable films with humidity-responsive optical properties for visual monitoring and preservation of fresh products.

Food chemistry·2026

Same journal

Entropic Graph-based Posterior Regularization.

JMLR workshop and conference proceedings·2024

Same journal

Uncovering Voice Misuse Using Symbolic Mismatch.

JMLR workshop and conference proceedings·2021

Same journal

Dirichlet Process Mixture Model for Correcting Technical Variation in Single-Cell Gene Expression Data.

JMLR workshop and conference proceedings·2018

Same journal

Anytime Exploration for Multi-armed Bandits using Confidence Information.

JMLR workshop and conference proceedings·2018

Same journal

Greedy Direction Method of Multiplier for MAP Inference of Large Output Domain.

JMLR workshop and conference proceedings·2017

Same journal

Experimental Design on a Budget for Sparse Linear Models and Applications.

JMLR workshop and conference proceedings·2017

See all related articles

Search research articles

Related Experiment Video

Updated: Feb 23, 2026

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

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

Published on: February 10, 2023

Scalable Convex Multiple Sequence Alignment via Entropy-Regularized Dual Decomposition.

Jiong Zhang¹, Ian E H Yen², Pradeep Ravikumar²

¹University of Texas at Austin.

JMLR Workshop and Conference Proceedings

|September 6, 2017

Summary

This summary is machine-generated.

We developed a new accelerated algorithm for Multiple Sequence Alignment (MSA) that improves alignment quality and speed. This method efficiently handles longer biological sequences compared to previous convex optimization techniques.

More Related Videos

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

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

Published on: July 14, 2015

A Practical Guide to Phylogenetics for Nonexperts

A Practical Guide to Phylogenetics for Nonexperts

Published on: February 5, 2014

Related Experiment Videos

Last Updated: Feb 23, 2026

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

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

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

Published on: July 14, 2015

A Practical Guide to Phylogenetics for Nonexperts

A Practical Guide to Phylogenetics for Nonexperts

Published on: February 5, 2014

Area of Science:

Bioinformatics
Computational Biology
Optimization

Background:

Multiple Sequence Alignment (MSA) is crucial for biological sequence analysis, aiding in phylogenetic tree construction, profile generation, and protein structure prediction.
The NP-hard nature of MSA necessitates heuristic and local-search methods, though a recent convex optimization approach showed promise.
Existing convex programming methods for MSA face scalability issues, limited to short sequences (up to 50) and exhibiting slow convergence.

Purpose of the Study:

To address the limitations of existing convex optimization approaches for Multiple Sequence Alignment (MSA).
To develop a more efficient and scalable algorithm for MSA that can handle significantly longer biological sequences.
To improve the quality and speed of MSA through a novel algorithmic approach.

Main Methods:

Proposed an accelerated dual decomposition algorithm for MSA.
Incorporated entropy regularization to achieve closed-form solutions for subproblems.
Developed a single-loop algorithm with iteration complexity linear to the total sequence length.

Main Results:

The accelerated dual decomposition algorithm significantly enhances alignment quality for sequences up to hundreds in length.
The new method demonstrates superior performance compared to existing techniques, including the previous convex programming approach.
The algorithm overcomes the convergence limitations of prior methods, which failed for longer sequences.

Conclusions:

The proposed accelerated dual decomposition algorithm offers a scalable and effective solution for Multiple Sequence Alignment.
This advancement enables high-quality MSA for longer biological sequences, expanding the applicability of convex optimization in bioinformatics.
The developed method represents a significant improvement over existing MSA algorithms, particularly in terms of speed and handling of large datasets.