The development of human genome project calls for more rapid and accurate protein structure prediction method to assign the structure and function of gene products. Threading has been proved to be successful in protei...The development of human genome project calls for more rapid and accurate protein structure prediction method to assign the structure and function of gene products. Threading has been proved to be successful in protein fold assignment,although difficulties remain for low homologous sequences. We have developed a method for solving the sequence rearrangement problem in threading. By reshuffling secondary elements,protein structures with the same spatial arrangement of secondary structures but different connections can be predicted. This method has been proved to be useful in fold recognition for proteins of different evolutionary origin and converge to the same fold.展开更多
A novel and simple technique to control the search direction of the differential mutation was proposed.In order to verify the performance of this method,ten widely used benchmark functions were chosen and the results ...A novel and simple technique to control the search direction of the differential mutation was proposed.In order to verify the performance of this method,ten widely used benchmark functions were chosen and the results were compared with the original differential evolution(DE)algorithm.Experimental results indicate that the search direction controlled DE algorithm obtains better results than the original DE algorithm in term of the solution quality and convergence rate.展开更多
There has been a growing interest in mathematical models to character the evolutionary algorithms. The best-known one of such models is the axiomatic model colled the abstract evolutionary algorithm. In this paper, we...There has been a growing interest in mathematical models to character the evolutionary algorithms. The best-known one of such models is the axiomatic model colled the abstract evolutionary algorithm. In this paper, we first introduce the definitions of the abhstract selection and evolution operators, and that of the abstract evolutionary algorithm, which describes the evolution as an abstract stochastic process composed of these two fundamental abstract operators. In particular, a kind of abstract evolutionary algorithms based on a special selection mechansim is discussed. According to the sorting for the state space, the properties of the single step transition matrix for the algorithm are anaylzed. In the end, we prove that the limit probability distribution of the Markov chains exists. The present work provides a big step toward the establishment of a unified theory of evolutionary computation.展开更多
文摘The development of human genome project calls for more rapid and accurate protein structure prediction method to assign the structure and function of gene products. Threading has been proved to be successful in protein fold assignment,although difficulties remain for low homologous sequences. We have developed a method for solving the sequence rearrangement problem in threading. By reshuffling secondary elements,protein structures with the same spatial arrangement of secondary structures but different connections can be predicted. This method has been proved to be useful in fold recognition for proteins of different evolutionary origin and converge to the same fold.
基金Project(2011FJ3016)supported by the Research Foundation of Science & Technology Office of Hunan Province,China
文摘A novel and simple technique to control the search direction of the differential mutation was proposed.In order to verify the performance of this method,ten widely used benchmark functions were chosen and the results were compared with the original differential evolution(DE)algorithm.Experimental results indicate that the search direction controlled DE algorithm obtains better results than the original DE algorithm in term of the solution quality and convergence rate.
基金Supported by the National Science Foundation of China(60133010)Supported by the Science Foundation of Henan Province(2000110019)
文摘There has been a growing interest in mathematical models to character the evolutionary algorithms. The best-known one of such models is the axiomatic model colled the abstract evolutionary algorithm. In this paper, we first introduce the definitions of the abhstract selection and evolution operators, and that of the abstract evolutionary algorithm, which describes the evolution as an abstract stochastic process composed of these two fundamental abstract operators. In particular, a kind of abstract evolutionary algorithms based on a special selection mechansim is discussed. According to the sorting for the state space, the properties of the single step transition matrix for the algorithm are anaylzed. In the end, we prove that the limit probability distribution of the Markov chains exists. The present work provides a big step toward the establishment of a unified theory of evolutionary computation.
