DNA Sequences Under Multiple Guanine-Cytosine (GC) Base Pairs Constraint

Area of Science:

• Computational Biology
• Bioinformatics
• Algorithm Design

Background:

• DNA computing offers high efficiency for complex problems.
• Designing high-quality DNA sequences is crucial but challenging.
• Existing algorithms may fall into local optima, limiting performance.

Purpose of the Study:

• To enhance the efficiency and quality of DNA sequence design for DNA computing.
• To address the challenge of local optima in DNA sequence design algorithms.
• To improve the stability and accuracy of DNA computing results.

Main Methods:

• Development of a sparrow evolutionary search algorithm (SESA) to improve search performance.
• Introduction of a novel multiple GC constraint to enhance DNA sequence quality.
• Utilizing NUPACK for simulated experiments to validate the proposed methods.

Main Results:

• SESA demonstrates improved search performance on discrete numerical problems compared to standard algorithms.
• The multiple GC constraint significantly enhances the quality of designed DNA sequences.
• Sequences designed with SESA and the new constraint exhibit superior stability.

Conclusions:

• The proposed SESA and multiple GC constraint offer a significant advancement in DNA sequence design.
• This approach effectively tackles the challenge of local optima and improves sequence quality.
• The enhanced DNA sequences hold promise for more accurate and stable DNA computing applications.