Related Concept Videos
Evolutionary Relationships through Genome Comparisons
Genome Annotation and Assembly
Maxam-Gilbert Sequencing
Challenges of the Maxam-Gilbert Method
The...
Sanger Sequencing
Next-generation Sequencing
Next-Generation Sequencing Methods
Although all next-generation methods use different technologies, they all share a set of standard features.
RNA-seq
Before the discovery of RNA-seq, microarray-based methods and Sanger sequencing were used for transcriptome analysis. However, while microarray-based...
You might also read
Related Articles
Articles linked to this work by shared authors, journal, and citation graph.
Structural and functional insights into the Rcs phosphorelay.
16S ribosomal RNA modification drives transcript-specific translation efficiency.
Large Language Models Meet Biomedical Knowledge Graphs for Mechanistically Grounded Therapeutic Prioritization.
Machine Learning Reveals the Contribution of Rare Genetic Variants and Enhances Risk Prediction for Coronary Artery Disease in the Japanese Population.
Impact of small area-level deprivation on survival outcomes in patients with Cholangiocarcinoma: a population-based multilevel survival analysis.
Missing Occupation, Missing Risk: Insights From COVID-19 Case Investigation Data in Busan, South Korea.
Research on multi-trait genome association study method based on Shannon information entropy.
A multi-view feature fusion framework with interpretable graph convolution for predicting microbe-drug associations.
Covariance decomposition for distance based species tree estimation.
SNPio: a Python interface for population genomic data processing.
SpaHNR: a spatial domain identification method via sparse attention-based hierarchical node representation and multi-view contrastive learning.
OpenIMC: an open-source platform for analyzing single-cell and spatial proteomics by imaging mass cytometry.
Related Experiment Video
Updated: Jun 25, 2026

Using Phylogenetic Analysis to Investigate Eukaryotic Gene Origin
Published on: August 14, 2018
SE: an algorithm for deriving sequence alignment from a pair of superimposed structures.
Chin-Hsien Tai1, James J Vincent, Changhoon Kim
1Molecular Modeling and Bioinformatics Section, Laboratory of Molecular Biology, Center for Cancer Research, National Cancer Institute, National Institutes of Health, Bethesda, MD 20892, USA. taic@mail.nih.gov
A new Seed Extension (SE) algorithm generates accurate sequence alignments from superimposed protein structures without using a gap penalty. This method outperforms traditional dynamic programming approaches, offering faster computation and improved accuracy for structural comparisons.
Area of Science:
- Bioinformatics
- Structural Biology
- Computational Biology
Background:
- Generating sequence alignments from superimposed structures is crucial for structure comparison, recognition, classification, and function prediction.
- Traditional dynamic programming algorithms for this task can introduce spurious gaps and misalignments due to gap penalties.
- A novel algorithm, Seed Extension (SE), is proposed to address these limitations.
Purpose of the Study:
- To develop and evaluate a new algorithm for generating sequence alignments from superimposed protein structures.
- To compare the accuracy and efficiency of the Seed Extension algorithm against existing dynamic programming methods.
Main Methods:
- The Seed Extension (SE) algorithm identifies structurally equivalent residues as 'seeds'.
- Seed segments are extended along the alignment matrix, using residue similarity and distance to resolve conflicts.
- The algorithm was validated against manually curated alignments in the Conserved Domain Database.
Main Results:
- SE achieved an average accuracy of 95.9% across 582 protein pairs, significantly outperforming dynamic programming methods (89.9%-91.0%).
- SE demonstrated up to 18% higher accuracy for proteins with low sequence or structural similarity.
- Implementing SE in SHEBA improved alignment accuracy by 10% and reduced CPU time compared to dynamic programming.
Conclusions:
- The Seed Extension algorithm provides a fast and accurate method for sequence alignment from superimposed structures.
- SE surpasses dynamic programming algorithms in accuracy and efficiency, particularly for challenging structural comparisons.
- This algorithm offers a valuable improvement for structure-based sequence alignment in bioinformatics.

