Modularity-based parallel protein design algorithm with an implementation using shared memory programming.

Area of Science:

• Computational Biology
• Protein Engineering
• Bioinformatics

Background:

• Protein design aims to identify amino acid sequences for specific 3D structures.
• The protein design problem is computationally challenging due to vast sequence search spaces.

Purpose of the Study:

• To propose a novel modularity-based parallel protein design algorithm.
• To improve search space exploration and convergence speed in protein design.

Main Methods:

• Developed a parallel algorithm exploiting protein modularity, defining protein units (PUs).
• Employed a divide-and-conquer strategy, splitting proteins into PUs for parallel exploration.
• Implemented a shared memory approach for parallel sequence search.

Main Results:

• The modularity-based parallel design showed improved search space exploration over traditional methods.
• Designed sequences exhibited an average of 39.7% similarity to benchmarks.
• Modeled structures achieved an average RMSD of 1.17 Å and a template modeling score of 0.89.
• 80% of designed proteins demonstrated comparable or superior stability via molecular dynamics simulations.

Conclusions:

• The modularity-based parallel algorithm is effective for protein design.
• The approach can be extended to protein interaction design.