3D Protein structure prediction with genetic tabu search algorithm

dc.contributor.authorZhang, Xiaolong
dc.contributor.authorWang, Ting
dc.contributor.authorLuo, Huiping
dc.contributor.authorYang, Jack Y.
dc.contributor.authorDeng, Youping
dc.contributor.authorTang, Jinshan
dc.contributor.authorYang, Mary Qu
dc.contributor.departmentMedicine, School of Medicineen_US
dc.date.accessioned2020-05-18T18:28:38Z
dc.date.available2020-05-18T18:28:38Z
dc.date.issued2010-05-28
dc.description.abstractBackground Protein structure prediction (PSP) has important applications in different fields, such as drug design, disease prediction, and so on. In protein structure prediction, there are two important issues. The first one is the design of the structure model and the second one is the design of the optimization technology. Because of the complexity of the realistic protein structure, the structure model adopted in this paper is a simplified model, which is called off-lattice AB model. After the structure model is assumed, optimization technology is needed for searching the best conformation of a protein sequence based on the assumed structure model. However, PSP is an NP-hard problem even if the simplest model is assumed. Thus, many algorithms have been developed to solve the global optimization problem. In this paper, a hybrid algorithm, which combines genetic algorithm (GA) and tabu search (TS) algorithm, is developed to complete this task. Results In order to develop an efficient optimization algorithm, several improved strategies are developed for the proposed genetic tabu search algorithm. The combined use of these strategies can improve the efficiency of the algorithm. In these strategies, tabu search introduced into the crossover and mutation operators can improve the local search capability, the adoption of variable population size strategy can maintain the diversity of the population, and the ranking selection strategy can improve the possibility of an individual with low energy value entering into next generation. Experiments are performed with Fibonacci sequences and real protein sequences. Experimental results show that the lowest energy obtained by the proposed GATS algorithm is lower than that obtained by previous methods. Conclusions The hybrid algorithm has the advantages from both genetic algorithm and tabu search algorithm. It makes use of the advantage of multiple search points in genetic algorithm, and can overcome poor hill-climbing capability in the conventional genetic algorithm by using the flexible memory functions of TS. Compared with some previous algorithms, GATS algorithm has better performance in global optimization and can predict 3D protein structure more effectively.en_US
dc.eprint.versionFinal published versionen_US
dc.identifier.citationZhang, X., Wang, T., Luo, H. et al. 3D Protein structure prediction with genetic tabu search algorithm. BMC Syst Biol 4, S6 (2010). https://doi.org/10.1186/1752-0509-4-S1-S6en_US
dc.identifier.urihttps://hdl.handle.net/1805/22790
dc.language.isoen_USen_US
dc.publisherBMCen_US
dc.relation.isversionof10.1186/1752-0509-4-S1-S6en_US
dc.relation.journalBMC Systems Biologyen_US
dc.rightsAttribution 4.0 International*
dc.rights.urihttps://creativecommons.org/licenses/by/4.0*
dc.sourcePublisheren_US
dc.subjectGenetic Algorithmen_US
dc.subjectTabu Searchen_US
dc.subjectTabu Listen_US
dc.subjectProtein Structure Predictionen_US
dc.subjectTabu Search Algorithmen_US
dc.title3D Protein structure prediction with genetic tabu search algorithmen_US
dc.typeArticleen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
1752-0509-4-S1-S6.pdf
Size:
4.03 MB
Format:
Adobe Portable Document Format
Description:
Main article
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.99 KB
Format:
Item-specific license agreed upon to submission
Description: