Houqe, M. T.; Chetty, M. and Dooley, L.
PDF (Not Set)
- Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
|Google Scholar:||Look up in Google Scholar|
Protein Folding Prediction (PFP) is essentially an energy minimization problem formalised by the definition of a fitness function. Several PFP models have been proposed including the Hydrophobic-Hydrophilic (HP) model, which is widely used as a test-bed for evaluating new algorithms. The calculation of the fitness is the major computational task in determining the native conformation of a protein in the HP model and this paper presents a new efficient search algorithm (ESA) for deriving the fitness value requiring only O(n) complexity in contrast to the full search approach, which takes O(n2). The improved efficiency of ESA is achieved by exploiting some intrinsic properties of the HP model, with a resulting reduction of more than 50% in the overall time complexity when compared with the previously reported Caching Approach, with the added benefit that the additional space complexity is linear instead of quadratic.
|Item Type:||Journal Article|
|Extra Information:||Special Issue on: Soft Computing for Modeling and Simulation
|Keywords:||HP Model; Fitness Function; Improved Computation; Relative Distance and Polarity;|
|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:||15 Jan 2016 20:17|
|Share this page:|