A complete and effective move set for simplified protein folding

  • Lesh N
  • Mitzenmacher M
  • Whitesides S
  • 40


    Mendeley users who have this article in their library.
  • 143


    Citations of this article.


We present new lowest energy configurations for several large benchmark problems for the two-dimensional hydrophobic-hydrophilic model. We found these solutions with a generic implementation of tabu search using an apparently novel set of transformations that we call pull moves. Our experiments show that our algorithm can find these best solutions in 3 to 14 hours, on average. Pull moves appear quite effective and may also be useful for other local search algorithms for the problem. Additionally, we prove that pull moves are complete; that is, any pair of valid configurations are mutually reachable through a sequence of pull moves. Our implementation was developed with the Human-Guided Search (HuGS) middleware, which allows rapid development of interactive optimization systems.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Neal Lesh

  • Michael Mitzenmacher

  • Sue Whitesides

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free