Almost FPRAS for lattice models of protein folding

  • Authors:

  • Anna Gambin;Damian Wójtowicz

  • Affiliations:

  • Institute of Informatics, Warsaw University, Warsaw, Poland;Institute of Informatics, Warsaw University, Warsaw, Poland

  • Venue:
  • WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

The provably efficient randomized approximation scheme which evaluates the partition function for the wide class of lattice models of protein prediction is presented. We propose to apply the idea of self-testing algorithms introduced recently in [8]. We consider the protein folding process which is simplified to a self-avoiding walk on a lattice. The power of a simplified approach is in its ability to search the conformation space, to train the search parameters and to test basic assumptions about the nature of the protein folding process. Our main theoretical results are formulated in the general setting, i.e. we do not assume any specific lattice model. For the simulation study we have chosen the HP model on the FCC lattice.