Home | About | Journals | Submit | Contact Us | Français |

**|**BMC Syst Biol**|**v.4(Suppl 1); 2010**|**PMC2880412

Formats

Article sections

- Abstract
- Background
- Methods
- Results and discussion
- Conclusions
- Competing interests
- Authors' contributions
- References

Authors

Related links

BMC Syst Biol. 2010; 4(Suppl 1): S6.

Published online 2010 May 28. doi: 10.1186/1752-0509-4-S1-S6

PMCID: PMC2880412

Xiaolong Zhang,^{}^{1} Ting Wang,^{1} Huiping Luo,^{1} Jack Y Yang,^{2,}^{3,}^{4} Youping Deng,^{5} Jinshan Tang,^{}^{1} and Mary Qu Yang^{3,}^{4}

Xiaolong Zhang: nc.ude.tsuw@gnahz.gnoloaix; Ting Wang: moc.361@anit_tw; Huiping Luo: moc.361@30016891phl; Jack Y Yang: ude.uhj@gnay.rd; Youping Deng: ude.msu@gneD.gnipuoY; Jinshan Tang: moc.oohay@gnatoadad; Mary Qu Yang: VOG.HIN.liam@amgnay

The ISIBM International Joint Conferences on Bioinformatics, Systems Biology and Intelligent Computing (IJCBS)

Yunlong Liu and A Keith Dunker

Publication of this supplement was made possible with support from the International Society of Intelligent Biological Medicine (ISIBM)

http://www.biomedcentral.com/content/pdf/1752-0509-4-S1-info.pdfThe ISIBM International Joint Conferences on Bioinformatics, Systems Biology and Intelligent Computing (IJCBS)

3–8 August 2009

Shanghai, China

Copyright ©2010 Zhang and Tang; licensee BioMed Central Ltd.

This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

This article has been cited by other articles in PMC.

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.

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.

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.

Protein structure prediction is defined as the prediction of the tertiary structure of a protein by using its primary structure information [1]. Till now, it has become an important research topics in bioinformatics and it has important applications in medicine and other fields, such as drug design, prediction of diseases, and so on. Because of the complexity of the realistic protein structure, it is hard to determine the exact tri-dimensional structure from its sequence of amino acids [2]. Therefore, a lot of coarse structure models have been developed. The HP model is the most conventional one among them and has been widely used in protein structure prediction [3]. Different from the complex structure models, HP model only assumes two types of amino acids—hydrophobic (H) and hydrophilic (P) and the sequence of amino acids is assumed to be embedded in a lattice, which is used to discretize the space of conformations. For simplicity, the only interaction considered in HP model is the interaction between the nonadjacent but next-neighboured hydrophobic monomers [3], which is used to force the formation of a compact hydrophobic core as observed in real proteins [4].

Although simplified models have the capability of catching nontrivial aspects of the folding problem, the approximations involved are not really suitable [5]. The main reason lies in that local interactions are neglected in the simplified models. As is well known, local interactions might be important for the local structure of the chains [6] and no sequences with compact, well-defined native structures could be found if local interactions are neglected [5]. Therefore, many other models which consider local interactions have drawn a lot of attention and been proposed. The AB off-lattice model [7,8] is the one that could meet the aforementioned requirement. Currently, AB off-lattice model has been widely applied to protein structure prediction and many improved models have been proposed based on the original model. In AB off-lattice model, two types of monomers are taken into consideration. The hydrophobic monomers are labelled by A while the hydrophilic ones are labelled by B. Different from HP model, the interactions considered in AB model include both sequence independent local interactions and the sequence dependent Lennard-Jones term that favours the formation of a hydrophobic core [7,8].

After a structure model is adopted, an important issue in PSP is to develop an optimization technology to find the best conformation of a protein sequence based on the assumed structure model. However, protein structure prediction (PSP) is an NP-hard problem even when the simplest models are assumed [9,10]. In order to tackle this issue, many heuristic approaches have been developed. In the past decades, researchers have developed many algorithms to solve the global optimization problem in protein folding structure prediction (PFSP). Genetic algorithm has been used for protein structure prediction for long time [11-17]. The reason why GAs are attractive is possibly due to their simplicity and efficiency in finding good solutions in large and complex search spaces [12,16]. It is well known that the combination of GA with local search strategies is particularly effective in PFP [2].

For example, the algorithm developed in [18] which is a hybrid scheme combining GA with simulated annealing algorithm, has much higher efficiency in searching for native states with off-lattice AB model than other methods. However, this method has a limitation that the searching time is too long, which affects its wide applications. In this paper we propose a novel hybrid approach for protein structure prediction. The proposed algorithm will combine genetic algorithm and tabu search algorithm to accurately search for the ground-state conformation of a given protein.

The off-lattice AB model was proposed in [7,8] and has been applied to protein structure prediction for decades. In off-lattice AB model, the monomers are linked by rigid unit-length bonds to form linear unoriented polymers in three-dimensional space. The energy functional for any n monomers chain is described as follows [8]:

(1)

where *θ _{i}* (0≤

In off-lattice AB model, the shape of an n-mer is determined by the (*n*-2) bond angles *θ*_{1},…,*θ _{n}*

Genetic algorithms [19] are adaptive heuristic search algorithms premised on the evolutionary ideas of natural selection and genetics, which select individuals by a fitness function. Individuals with higher fitness values have higher opportunity to generate the successors. Although genetic algorithms are widely used in optimization problems, they still need improvement for PSP. GA has two main disadvantages which affect their performance for PSP. One is the premature convergence and the other is the slow convergence rate. The premature convergence is mainly caused by the small variability in mutation strategy and the slow convergence rate results from heavy dependence on crossover strategy.

In order to overcome the disadvantages in GAs, we introduce tabu search (TS) [20] into the crossover and mutation operators in GAs to improve the local search capability. Tabu search [20] is a local neighborhood search algorithm which guides the next search direction by using flexible memory functions to record and choose the optimization process. The advantage of TS is the short searching time and the disadvantage is the low global search capability. Thus, the combination of GA and TS results in a hybrid algorithm which combines both of the advantages of the GA and TS [21].

The following five strategies are used in the proposed algorithm for protein structure prediction:

Chromosome encoding is the way the individuals are represented and is very important because it affects the performance of a genetic algorithm. In the proposed algorithm, Cartesian coordinates are adopted to represent the individuals because of its simplicity. Let *h* be an individual. For an *n*-residue long chain, *h* can be expressed as (*θ*_{1},…,*θ _{n}*

(2)

The coordinates of the first few residues are (0,0,0), (0,1,0), and (cos(*θ*_{1}),sin(*θ*_{1}),0). Latter residues’ coordinates are all calculated on the base of the previous one’s coordinate.

In genetic algorithm, with the difference between individuals get smaller and smaller after several rounds of evolution, premature convergence to poor solution will generally happen. Hence, the second strategy used in the proposed algorithm is to adopt variable population size. Variable population size strategy adopted by genetic algorithm can prevent premature convergence by increasing or decreasing the population size when the optimal energy is very close to the average value of the population [22].

Ranking selection strategy is used in the proposed algorithm to select individuals from the current population into next generation. The main benefit of ranking selection lies in that it can bring the individuals with lower energy values into the next generation, and let the best individual obtained so far not be crossed out or damaged by mutation, and thus guarantee the convergence of the algorithm [22].With this strategy, whenever the hypothesis population has been updated, individuals are rearranged from minimum to maximum based on the energy values* E*(*h*) (obtained by (1)), and then the individuals in the front of the population will be made to have higher probability to be selected. The adoption of this strategy can make the best individuals enter into the next generation directly and avoid being operated by crossover and mutation operators.

In the proposed algorithm, the mutation operator adopted is tabu search mutation operator. Tabu search mutation operator is similar to the standard mutation operator except that TSM is a search process. With this strategy, the potential energy functional in equation (1) is used as the evaluation function to compute the offspring’s energy values, and then these offspring and their energy values are combined with the tabu list to determine the output offspring. Therefore, TSM can accept inferior solutions during the search process, and thus it has stronger hill-climbing capability than many other mutation operators [21,23]. TSM is composed of several steps (see Figure Figure1),1), which can be described as follows: Firstly, disturbance mutation method is used to generate neighbor solutions of the current solutions. In this processing, two mutation operations are used. The first mutation operation is a two-point mutation operation and is used in the early stage; the second mutation operation is a single-point mutation which is adopted in the later stage to raise the convergence speed. Disturbance mutation implementation is presented as follows. Let the *j *th parameter selected be and the new parameter be, then we have

(3)

where *r* is a random number between 0 and 1. in term is used to assure large disturbance degree in the early search procedure (α tends to 0) to keep the diversity of the solutions, and small disturbance degree in the later search procedure (α tends to 1) to increase convergence rate and guarantee the algorithm to converge to a global optimum. and are defined as follows:

(4)

(5)

is used to ensure the diversity of the neighbour solutions, which is similar to [24]. *j* donates the location of the *j *th parameter in individual *h*, *n* is the parameter length of *h*. is the scale factor of parameter . Secondly, the individuals in the neighbor solutions are sorted by the energy values in ascending order and the lower energy individuals will be used to generate the candidate set. Finally, each solution in the candidate set will be determined to be the output of the TSM or not. This processing is based on two tabu lists as in [24]. The first tabu list is composed of a set of solution vectors and the second one is composed of a set of energy values of the corresponding solutions. The use of two tabu lists can let the algorithm avoid being trapped in local optima.

In order to determine whether a candidate solution is a tabu, we use the following criteria: let the energy value of the candidate solution be *E*(*h*)(computed by (1)). If there is a solution in tabu list *TS* which satisfies |*E*(*y*)-*E*(*h*)| ≤ *ψ* and ||*y*-*h*|| ≤ *η*, then the candidate solution *h* is thought as a tabu. In TSM, it is possible that total tabu [24] happens. When total tabu happens, all the solutions in the candidate set are forbidden and the next current solution can not be selected from the candidate set. In order to handle total tabu, when total tabu happens, we select the global best solution to generate mutation and the output solution will be set as current solution.

Another strategy used in the proposed algorithm is tabu search recombination. With this strategy, TSR records the fitness values of individuals in a tabu list and the fitness values of the offspring individual after crossover operation will be compared with some desired level and will be determined to be accepted by next generation or the tabu list. In this paper, the average fitness value of the population is considered as the desired level and the crossover strategy is random linear combination. Let be one individual and be the other individual of the crossover couple, be the offspring individual after crossover operation, random linear combination is described by [25]

(6)

where is the individual with minimum energy so far.

In order to avoid close match, before the crossover operation, TSR uses the following way to select the individuals as the crossover individual couple into cross pool: it will first sort the individuals by their energy values in ascending order, and then the individuals with the furthest distance are selected for crossover operation. After the crossover offspring is obtained, its fitness value is compared with the desired level. The comparison is as follows: if the fitness value of the offspring is better than the desired value, the offspring will be set free, and accepted by next generation. If the fitness value of the offspring is worse than the desired value and is not in tabu list, the offspring will also be accepted. However, if the offspring is in the tabu list, TSR will select one parent with better fitness value to go into the next generation. In TSR, the use of tabu list keeps the diversity among individuals and avoids premature convergence.

Genetic algorithm and tabu search algorithm have their own advantages and disadvantages, thus the development of a scheme which keeps the advantages while overcomes the disadvantages of each algorithm can provide efficient search for protein structure prediction. GATS, a hybrid algorithm, satisfies this requirement. For example, GATS makes use of the advantages of multiple search points in GA and can overcome the poor hill-climbing capability by using the flexible memory functions of TS.

The basic idea of the proposed GATS is described in Figure Figure2.2. The search algorithm starts with the initialization of parameters by some appropriate values. Then, the population *P* with individuals is generated randomly, and equation (1) is used to obtain the energy values. After that, the individuals are sorted by the energy values from minimum to maximum and at the same time, the minimal solution and the minimal energy are saved as *h*_{min} and *E*_{min} respectively. During the search process, population *P* is handled by TSR and TSM by turns. When TSR handles the population, it will select *r***n* parents from the latter 90% locations to perform crossover operation with *h*_{min}, and the preceding 10% locations are recognized as duplicated individuals. The offspring will be considered whether are accepted based on the current tabu list. When TSM handles the population, *m***n* mutation parents will be selected probabilistically, and each parent uses TSM operation to generate offspring. Whenever the population *P* is updated, individuals will be rearranged to be from minimal to maximal by the energy values. Finally, the hypothesis *h*_{min} and minimum energy *E*_{min} will be used as the optimal values at the end of algorithm.

In this section, we describe our experiments by using Fibonacci sequences to test the efficiency of the proposed GATS. A Fibonacci sequence is defined recursively by

*S*_{0} = *A, S*_{1} = *B, S _{i}*

where * is the concatenation operator. Some examples of Fibonacci sequences are *S*_{2} = *AB*, *S*_{3} = *BAB*, *S*_{4} = *ABBAB*, etc. For comparison, we used the same Fibonacci sequences as those used in [24,26-28].

GATS was implemented by C++ in Windows XP. The parameters in the algorithm were obtained by experiments and they were set as follows: self-adjustable population scale was set to be in the range of 100~500, the crossover rate was set to be 0.88, the mutation rate was set to be in the range of 0.012~0.025, self-adjustable tabu list length was set to be in the range of 7~14, neighbourhood set length was set to be in the range of 30~50, candidate set length was set to be in the range of 5~6. The minimal energy values () obtained by GATS on the three-dimensional off-lattice AB model are listed in Table Table1.1. For comparison, we also list the minimal energy values obtained by the Simulated Annealing (SA) [28], the energy landscape paving minimizer (ELP) [26], the conformational space annealing (CSA) [27], and the tabu search algorithm (TS) [24] respectively. The corresponding bond angles and the torsional angles at the global minima are shown in Table Table22.

Lowest energies for Fibonacci sequences obtained by the previous algorithms and the proposed GATS algorithm

The (n-2) bond angles and (n-3) torsional angles at the global minimum energies of four Fibonacci sequences by GATS

From table table1,1, we can find that the lowest energy value obtained by the proposed GATS is smaller than those obtained by SA, ELP and CSA for all the four Fibonacci sequences, and smaller than that obtained by TS for the sequences with lengths 13, 21, 55. Although the lowest energy value obtained by GATS is not as low as that obtained by TS for the sequence with length 34, it is smaller than that obtained by TS for the sequences with lengths 55, which shows that GATS has better performance for long sequence.

The lowest-energy ground configurations of Fibonacci sequences listed in Table Table11 are presented in Figure Figure3.3. In Figure Figure3,3, the solid dots indicate the hydrophobic monomers *A* while the empty dots indicate the hydrophilic monomers *B*. Figure Figure33 shows that all the conformations form single compact hydrophobic cores surrounded by hydrophilic residues, which is observed in real proteins. The results verify that it is reasonable to use AB model with Fibonacci sequences in three dimensions to mimic the real protein.

In this section, we describe the experimental results using real protein sequences. The real protein sequences used in our experiments were downloaded from the website: http://pdbbeta.rcsb.org/pdb/Welcome.do. For comparison, we used the same three protein sequences as those used in [29]. The PDB ID of the three protein sequences are 1BXL, 1EDP and 1AGT, respectively. In the experiments, the same K-D method used in [29,30] were adopted to distinguish the hydrophobic monomers from the hydrophilic ones, where *I, V, L, P, C, M, A, G* are considered to be hydrophobic while *D, E, F, H, K, N, Q, R, S, T, W, Y* are hydrophilic. Because there are few papers dealing with the real protein structure prediction issue using off-lattice AB model, we only compared our experimental results with the results in [29].

The experimental results for the real proteins are presented in Table Table3,3, and the corresponding lowest protein landscapes obtained by our GATS are shown in Figure Figure4.4. Table Table33 shows that the minimal energy values obtained by the proposed GATS are lower than those obtained by TS in [29], especially for long sequences. The results demonstrate that GATS is much more efficient than TS in protein folding structure prediction using AB off-lattice model. From Figure Figure4,4, we find that all the configurations have also formed a hydrophobic core, surrounded by hydrophilic residues. However, the hydrophobic core of 1AGT, which is the longest among the three real proteins, seems not to be compact enough. This may indicate that the performance of the coarse simplified AB off-lattice model is not effective enough for the prediction of the structure for long protein sequences.

Minimum energies for three real proteins obtained by TS and GATS algorithm using off-lattice AB model in three dimensions.

A hybrid algorithm that combines genetic algorithm and tabu search algorithm is developed for 3-D protein structure prediction using off-lattice AB model. The proposed algorithm can deal with multi-extremum and multi-parameter problems. In the proposed algorithm, different strategies are adopted to make the proposed algorithm have different advantages. For examples, the variable population size strategy can keep the diversity of the population, and TSM strategy makes it possible to accept poor solution as the current solution and thus makes the algorithm have better hill-climbing capability and stronger local searching capability than many other mutation operators. In addition, TSR strategy can limit the frequency that the offsprings with the same fitness appear, and thus can also keep the diversity of the population and avoid premature convergence of the algorithm. Compared with the previous algorithms, GATS has stronger capability of global searching. In the future work, we will improve the algorithm and make it more effective for long protein sequence prediction using multi-core computing platforms [31].

The authors declare that they have no competing interests.

XZ designed the algorithm and analyzed the experimental results. TW participated in the implementation of algorithm, and did the experiments with the given data. HL took part in the implementation of the algorithm and data processing. XZ, TW and HL wrote the original version of the paper. JT and YD helped rewriting the paper based on the original version. JYY and MQY contributed to the development of the algorithm, and provided many useful insights on protein modeling. All authors agreed on the content of the paper.

This work was supported in part by Project (2008TD04) from the Science Foundation of Wuhan University of Science and Technology, and Open Foundation of the State Key Laboratory of Bioelectronics of Southeast University, and the Scientific Research Foundation for the Returning Overseas Chinese Scholars of the State Ministry of Education of China, and the Provincial Research Project (No. 2008CDB344, 2009CDA034) from the Hubei Province Natural Science Foundation of China, as well as the National Natural Science Foundation of China (NSF-C 60975031). We also thank T. K. Li Professor A Keith Dunker, President of the International Society of Intelligent Biological Medicine, and the Secretary-General Professor Yunlong Liu for their excellent work in organizing reviews and provided us useful comments from the anonymous reviewers

This article has been published as part of *BMC Systems Biology* Volume 4 Supplement 1, 2010: Proceedings of the ISIBM International Joint Conferences on Bioinformatics, Systems Biology and Intelligent Computing (IJCBS). The full contents of the supplement are available online at http://www.biomedcentral.com/1752-0509/4?issue=S1.

- Anfinsen CB. Principles that govern the folding of protein chains. Science. 1973;181:223–227. doi: 10.1126/science.181.4096.223. [PubMed] [Cross Ref]
- Lopes HS. Studies in Computational Intelligence. Vol. 151. Springer Berlin; 2008. Evolutionary Algorithms for the Protein Folding Problem: A Review and Current Trends. pp. 297–315. full_text.
- Dill KA. Theory for the folding and stability of globular proteins. Biochemistry. 1985;24:1501–1509. doi: 10.1021/bi00327a032. [PubMed] [Cross Ref]
- Hart WE, Newman A. In: Handbook of Molecular Biology. Aluru S. Chapman & Hall/CRC Computer and Information Science Series, editor. CRC Press; 2006. Protein structure prediction with lattice models. pp. 1–24.
- Irbäck A, Sandelin E. Local Interactions and Protein Folding: Model Study on the Square and Triangular Lattices. J. 1998;108(5):2245–2250. doi: 10.1063/1.475605. [Cross Ref]
- Irbäck A, Peterson C, Potthast F, Sommelius O. Local interactions and protein folding: A three-dimensional off-lattice approach. J. 1997;107:273–282. doi: 10.1063/1.474357. [Cross Ref]
- Stillinger FH, Head-Gordon T, Hirshfel CL. Toy model for protein folding. Phys. 1993;48(E):1469–1477. [PubMed]
- Stillinger FH, Head-Gordon T. Collective aspects of protein folding illustrated by a toy model. Phys. 1995;52(E):2872–2877. [PubMed]
- Hart WE, Istrail S. Robust proofs of NP-hardness for protein folding general lattices and energy potentials. Journal of Computational Biology. 1997;4(1):1–22. doi: 10.1089/cmb.1997.4.1. [PubMed] [Cross Ref]
- Ngo JT, Marks J, Karplus M. In: The Protein folding problem and tertiary structure prediction. Mertz M, Grand ML. S Birkhauser, editor. 1994. Computational complexity, protein structure prediction, and the Levinthal paradox. pp. 433–506.
- Unger R, Moult J. On the Applicability of Genetic Algorithms to Protein Folding. The Twenty-Sixth Hawaii International Conference on System Sciences. 1993. pp. 715–725. full_text.
- Unger R, Moult J. Genetic Algorithms for Protein Folding Simulations. Journal of Molecular Biology. 1993;231(1):75–81. doi: 10.1006/jmbi.1993.1258. [PubMed] [Cross Ref]
- Hoque MT, Chetty M, Dooley LS. A New Guided Genetic Algorithm for 2D Hydrophobic-Hydrophilic Model to Predict Protein Folding. IEEE Congress on Evolutionary Computation. 2005.
- Corne DW, Fogel GB. In: Evolutionary Computation in Bioinformatics. Fogel GB, Corne DW, editor. Elsevier India; 2004. An Introduction to Bioinformatics for Computer Scientists. pp. 3–18.
- Takahashi O, Kita H, Kobayashi S. Protein Folding by a Hierarchical Genetic Algorithm. 4th Int. 1999. pp. 19–22.
- Unger R, Moult J. Genetic Algorithm for 3D Protein Folding Simulations. 5th International Conference on Genetic Algorithms. 1993. pp. 581–588.
- König R, Dandekar T. Journal of Molecular Modeling. Vol. 5. Springer Berlin; 1999. Refined Genetic Algorithm Simulation to Model Proteins. pp. 317–324. [Cross Ref]
- Zhang X, Lin X, Wan C, Li T. Genetic-Annealing Algorithm for 3D Off-lattice Protein Folding Model. PAKDD workshops. 2007;4819:186–193.
- Holland J. Adaptation in nature and artificial systems. University of Michigan Press; 1975. pp. 120–142.
- Glover F. Future paths for integer programming and links to artificial intelligence. Computers and Operations Research. 1986;13:533–549. doi: 10.1016/0305-0548(86)90048-1. [Cross Ref]
- Glover F, Kelly JP, Laguna M. Genetic algorithms and tabu search: Hybrids for optimization. Computers and Operations Research. 1995;22(1):111–134. doi: 10.1016/0305-0548(93)E0023-M. [Cross Ref]
- Zhu J. Non-classical mathematics for Intelligent Systems. Huazhong University of Science and Technology Press; 2001. pp. 285–288.
- Li D, Wang L, Wang M. Genetic algorithms and tabu search: a hybrid strategy. Journal of Systems engineering. 1998;13(3):28–34.
- Zhang X, Cheng W. Protein 3D structure prediction by improved tabu search in off-lattice AB model. ICBBE. 2008. pp. 184–187.
- Michalewicz Z. Genetic algorithms + data structures = evolution programs. 3rd. Springer-Verlag; 1996.
- Bachmann M, Arkin H, Janke W. Multicanonical study of coarse-grained off-lattice models for folding heteropolymers. Phys. 2005;E71:031906. [PubMed]
- Kim SY, Lee S B, Lee J. Structure optimization by conformational space annealing in an off-lattice protein model. Phys. 2005;E72:011916. [PubMed]
- Chen M, Huang W. Simulated Annealing Algorithm for Protein Folding Problem. Mini-Micro Systems. 2007;28(1):75–78.
- Cheng W. Protein 3D Structure Prediction by Improved Tabu Search. Master dissertation of Wuhan University of Science and Technlogy. 2009.
- Mount DW. Bioinformatics: sequence and genome analysis. Cold Spring Harbor, Cold Spring Harbor Laboratory Press; 2001.
- Yang Q M, Yang Jack Y. Lecture notes: 2010 and beyond, the decade of high-performance computing for the next-generation sequence analysis. I. J. Computational Biology and Drug Design. 2009;2(2):204–206. doi: 10.1504/IJCBDD.2009.028824. [PubMed] [Cross Ref]

Articles from BMC Systems Biology are provided here courtesy of **BioMed Central**