Protein structure alignment by incremental combinatorial extension (CE) of the optimal path

Area of Science:

• Structural bioinformatics
• Computational biology
• Protein structure analysis

Background:

• Protein structure alignment is crucial for understanding function and evolution.
• Conventional methods like dynamic programming and Monte Carlo optimization have limitations in speed and accuracy.
• Identifying structural similarities aids in protein classification and drug discovery.

Purpose of the Study:

• To introduce a new algorithm for protein structure alignment based on combinatorial extension (CE).
• To evaluate the algorithm's speed and accuracy compared to existing methods.
• To identify novel structural similarities between proteins.

Main Methods:

• The algorithm utilizes aligned fragment pairs (AFPs) defined by local geometry.
• Combinatorial extension selectively combines and extends AFPs to form optimal alignment paths.
• The CE method avoids traditional dynamic programming and Monte Carlo optimization.

Main Results:

• The CE algorithm demonstrates high speed and accuracy in protein structure alignment.
• New structural similarities were identified that were missed by Dali and VAST.
• The method is effective for large-scale database scanning and family analysis.

Conclusions:

• The CE algorithm offers a powerful new approach for protein structure alignment.
• Its efficiency and accuracy make it suitable for comprehensive structural genomics initiatives.
• Web-based access is provided for one-on-one alignments and database searches.