Copy the page URI to the clipboard
Houqe, Tamjid; Chetty, Madhu and Dooley, Laurence S.
(2006).
DOI: https://doi.org/10.1109/CIBCB.2006.331014
Abstract
Traditional encodings for hydrophobic(H)-hydrophilic(P) model or HP lattice models is isomorphic, which adds unwanted variations for the same solution, thereby slowing convergence. In this paper a novel non-isomorphic encoding scheme is presented for HP lattice model, which constrains the search space. In addition, similarity comparisons are made easier and more consistent and it will be shown that non-deterministic search approach such as genetic algorithm (GA) converges faster when non-isomorphic encoding is employed.