A method for the simultaneous alignment of three or more amino acid sequences

Area of Science:

• Bioinformatics
• Computational Biology
• Sequence Analysis

Background:

• Multiple sequence alignment is crucial for understanding protein evolution and function.
• Existing algorithms can be computationally intensive and memory-demanding for large datasets.

Purpose of the Study:

• To develop a novel, efficient algorithm for the concurrent comparison of three or more amino acid sequences.
• To address the computational and memory limitations of current multiple sequence alignment methods.

Main Methods:

• A progressive evaluation of selected segments from each amino acid sequence.
• Comparison of a small subset of all possible segments, retaining minimal information for alignment traceback.
• Implementation of a computer program for aligning three, four, and five sequences.

Main Results:

• The algorithm demonstrates rapid execution speed.
• The method exhibits minimal computer memory consumption during alignment construction.
• No practical limits on the length of sequences that can be aligned were observed.
• The novel method was compared favorably against Needleman-Wunsch extensions for three-sequence alignment.

Conclusions:

• The developed algorithm offers a computationally efficient and memory-sparing solution for multiple sequence alignment.
• This approach enables the alignment of very long amino acid sequences, overcoming previous limitations.
• The method provides a valuable tool for various bioinformatics and computational biology applications.