Related Experiment Video
Updated: Feb 23, 2026

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 Zhang1, Ian E H Yen2, Pradeep Ravikumar2
1University of Texas at Austin.
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.
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.
Related Concept Videos
Multi-species Conserved Sequences
Although the genome of each species varies greatly from each other, a few sequences are highly conserved. Such conserved...
Per-Unit Sequence Models
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
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
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
Challenges of the Maxam-Gilbert Method
The...
Conservation of Protein Domains

