Comparative analysis of the quality of a global algorithm and a local algorithm for alignment of two sequences

Area of Science:

• Bioinformatics
• Computational Biology
• Genomics

Background:

• Sequence alignment algorithms are crucial for biopolymer analysis.
• Assessing alignment quality is essential for accurate biological interpretation.
• The Smith-Waterman algorithm is a leading pairwise alignment method, but its local vs. global application needs study.

Purpose of the Study:

• To evaluate the quality of local and global sequence alignment algorithms.
• To determine the influence of homologous region length, nonhomologous regions, and core region positioning on alignment accuracy.
• To establish criteria for selecting optimal alignment algorithms based on sequence characteristics.

Main Methods:

• Utilized model series of amino acid sequence pairs.
• Analyzed alignment quality (accuracy and confidence) using both local and global alignment methods.
• Varied evolutionary distances (30-240 PAM), core sequence lengths (10-70%), and core region positions.

Main Results:

• Quantified the average quality of local and global alignments under diverse conditions.
• Identified specific scenarios favoring global alignment, particularly with longer evolutionary distances and larger nonhomologous parts when core regions are similarly positioned.
• Demonstrated local alignment's superiority in stability for asymmetric core region placements under similar evolutionary pressures.

Conclusions:

• Established criteria for choosing between local and global alignment algorithms based on sequence features.
• Showcased global alignment's robustness for conserved, overlapping sequences.
• Highlighted local alignment's advantage for divergent sequences with distinct homologous regions.
• Proposed a combined approach for enhanced alignment accuracy.