Houqe, Tamjid; Chetty, Madhu and Dooley, Laurence S.
|DOI (Digital Object Identifier) Link:||http://doi.org/10.1109/CIBCB.2006.331014|
|Google Scholar:||Look up in Google Scholar|
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.
|Item Type:||Conference Item|
|Academic Unit/Department:||Mathematics, Computing and Technology > Computing & Communications
Mathematics, Computing and Technology
|Interdisciplinary Research Centre:||Centre for Research in Computing (CRC)|
|Depositing User:||Laurence Dooley|
|Date Deposited:||10 Apr 2008|
|Last Modified:||14 Jan 2016 16:54|
|Share this page:|