F Zare-Mirakabad - Department of Mathematics and computer science, Amirkabir University, Tehran, Iran
M Movahedia - Department of Mathematics and computer science, Amirkabir University, Tehran, Iran
N Sarang - Department of Mathematics and computer science, Amirkabir University, Tehran, Iran
S. S Arab - Department of Biophysics, Faculty of Biological Sciences Tarbiat Modares University, Tehran, iran

According to structure-dependent function of proteins, two main challenging problems called Protein Structure Prediction (PSP) and Inverse Protein Folding (IPF) are investigated. In spite of IPF essential applications, it has not been studied as much as PSP problem. In fact, the ultimate goal of IPF problem or protein design is to create proteins with enhanced properties or even novel functions. One of the major computational challenges in protein design is large protein sequence space, namely searching through all plausible sequences is impossible. In our previous research, we introduced a genetic algorithm called GAPSSIF for designing protein secondary structure. This algorithm benefits from evolutionary information obtained by solved protein structures in PDB. Therefore, we constructed a repository of protein secondary sub-structures to accelerate convergence of the algorithm. The secondary structures of designed sequences by GAPSSIF are comparable with those obtained by Evolver and EvoDesign. In this paper, we modify GAPSSIF so it considers solvent accessibility. Therefore, the simple fitness function of GAPSSIF is improved by a multi-featured one to search through the sequence space more precisely.

Evolutionary information; Protein design; Protein structure prediction