Efficient Multiple Sequences Alignment Algorithm Generation via Components Assembly Under PAR Framework.

Area of Science:

• Bioinformatics
• Computational Biology
• Algorithm Development

Background:

• Sequence alignment algorithms are crucial in bioinformatics for analyzing sequence similarity and searching genome databases.
• Current research often lacks a high-level framework for domain-specific algorithm development, leading to complexity and potential errors in multiple sequence alignment.
• Existing multiple sequence alignment algorithms can be difficult to understand and select, hindering user accessibility.

Purpose of the Study:

• To develop a high-level abstract domain algorithm framework for multiple sequence alignment.
• To improve the efficiency and accuracy of developing and calculating complex sequence alignment algorithms.
• To enable efficient generation of programs (C++/Java/Python) for specific multiple sequence alignment algorithms.

Main Methods:

• Construction of a component library for pairwise sequence alignment algorithms.
• Development of expansion domain components for the multiple sequence alignment application domain.
• Design and generation of a star alignment algorithm as a demonstration.

Main Results:

• Efficient design and program generation for specific multiple sequence alignment algorithms.
• Demonstrated improvement in development efficiency for complex algorithms.
• Enhanced accuracy in sequence alignment calculations.
• Successful generation of a star alignment algorithm using the developed framework.

Conclusions:

• The developed framework and component library facilitate the creation of multiple sequence alignment algorithms.
• The approach enhances both the development efficiency and computational accuracy of sequence alignment.
• This work provides a more accessible and robust method for tackling complex bioinformatics challenges in sequence analysis.