The Open UniversitySkip to content

Generalized Schemata Theorem Incorporating Twin Removal for Protein Structure Prediction

Houqe, Tamjid; Chetty, Madhu and Dooley, Laurence S. (2007). Generalized Schemata Theorem Incorporating Twin Removal for Protein Structure Prediction. In: ed. Pattern Recognition in Bioinformatics. Lecture Notes in Computer Science. Springer, pp. 84–97.

DOI (Digital Object Identifier) Link:
Google Scholar: Look up in Google Scholar


The schemata theorem, on which the working of Genetic Algorithm (GA) is based in its current form, has a fallacious selection procedure and incomplete crossover operation. In this paper, generalization of the schemata theorem has been provided by correcting and removing these limitations. The analysis shows that similarity growth within GA population is inherent due to its stochastic nature. While the stochastic property helps in GA’s convergence. The similarity growth is responsible for stalling and becomes more prevalent for hard optimization problem like protein structure prediction (PSP). While it is very essential that GA should explore the vast and complicated search landscape, in reality, it is often stuck in local minima. This paper shows that, removal of members of population having certain percentage of similarity would keep GA perform better, balancing and maintaining convergence property intact as well as avoids stalling.

Item Type: Book Chapter
ISBN: 3-540-75285-4, 978-3-540-75285-1
Keywords: Schemata theorem; twin removal; protein structure prediction; similarity in population; hard optimization problem;
Academic Unit/Department: Mathematics, Computing and Technology > Computing & Communications
Mathematics, Computing and Technology
Interdisciplinary Research Centre: Centre for Research in Computing (CRC)
Item ID: 10538
Depositing User: Laurence Dooley
Date Deposited: 08 Apr 2008
Last Modified: 14 Jan 2016 16:53
Share this page:


Scopus Citations

▼ Automated document suggestions from open access sources

Actions (login may be required)

Policies | Disclaimer

© The Open University   + 44 (0)870 333 4340