ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

The algorithmics of folding proteins on lattices

Chandru, Vijay and DattaSharma, Abhi and Kumar, Anil VS (2003) The algorithmics of folding proteins on lattices. In: Discrete Applied Mathematics, 127 (1). pp. 145-161.

[img] PDF
algorithmics.pdf
Restricted to Registered users only

Download (153Kb) | Request a copy

Abstract

It should be possible to predict the fold of a protein into its native conformation, once we are given the sequence of the constituent amino acids. This is known as the protein structure prediction problem and is sometimes referred to as the problem of deciphering the second half of the genetic code. While large proteins fold in nature in seconds, computational chemists and biologists have found that folding proteins to their minimum energy conformations is a challenging unsolved optimization problem. Computational complexity theory has been useful in plaining, at least partially, this (Levinthal’s) paradox. The pedagogic cross-disciplinary survey by Ngo, Marks and Karplus (Computational Complexity, Protein Structure rediction and the Levinthal Paradox, Birkhauser, Basel, 1994) provides an excellent starting point for non-biologists to take a plunge into the problem of folding proteins. Since then, there has been remarkable progress in the algorithmics of folding proteins on discrete lattice models, an account of which is presented herein.

Item Type: Journal Article
Additional Information: Copyright of this article belongs to Elsevier.
Department/Centre: Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)
Date Deposited: 02 Jun 2006
Last Modified: 19 Sep 2010 04:28
URI: http://eprints.iisc.ernet.in/id/eprint/7274

Actions (login required)

View Item View Item