Improved Bare Bones Particle Swarm Optimization for DNA Sequence Design.

Area of Science:

• Bioinformatics
• Computational Biology
• Artificial Intelligence

Background:

• DNA computing offers significant computational power but relies on high-quality DNA sequences for encoding.
• Designing reliable DNA sequences is a complex, NP-hard problem due to conflicting constraints within a vast solution space.
• Existing methods struggle to efficiently generate DNA sequences that meet stringent reliability requirements.

Purpose of the Study:

• To develop an advanced optimization algorithm for designing high-quality, reliable DNA sequences for DNA computing.
• To enhance the efficiency and effectiveness of DNA sequence design by addressing limitations in current approaches.

Main Methods:

• Proposed an Improved Bare Bones Particle Swarm Optimization (IBPSO) algorithm.
• Incorporated dynamic opposition-based learning for improved population diversity and global search capability.
• Utilized a signal-to-noise ratio (SNR) evolutionary strategy for balancing exploration and exploitation, and Invasive Weed Optimization with Niche Crowding (NCIWO) to refine solutions. Introduced triplet-bases unpaired constraints.

Main Results:

• The IBPSO algorithm demonstrated superior performance in designing DNA sequences compared to six other advanced algorithms.
• Ablation experiments validated the effectiveness of the proposed algorithmic enhancements.
• The designed DNA sequences exhibited significantly higher quality, meeting complex reliability criteria.

Conclusions:

• The developed IBPSO algorithm effectively addresses the challenges in designing reliable DNA sequences for DNA computing.
• The integration of novel optimization techniques and constraints leads to superior DNA sequence quality.
• This work provides a robust computational framework for advancing DNA-based computation through improved sequence design.