Protein folding on lattices: an integer programming approach

The Digital Institutional Repository of IIM Bangalore

Please use this identifier to cite or link to this item: https://repository.iimb.ac.in/handle/123456789/631

DC Field	Value	Language
dc.contributor.author	Chandru, Vijay	en_US
dc.contributor.author	Rao, Mendu Rammohan	en_US
dc.contributor.author	Swaminathan, Ganesh	en_US
dc.date.accessioned	2012-07-26T11:27:42Z
dc.date.accessioned	2016-01-01T07:13:32Z
dc.date.accessioned	2019-05-27T08:37:30Z	-
dc.date.available	2012-07-26T11:27:42Z
dc.date.available	2016-01-01T07:13:32Z
dc.date.available	2019-05-27T08:37:30Z	-
dc.date.copyright	2002	en_US
dc.date.issued	2002
dc.identifier.other	WP_IIMB_199	-
dc.identifier.uri	http://repository.iimb.ac.in/handle/123456789/631	-
dc.description.abstract	In this paper, we initiate the study of the protein folding problem from an integer linear programming perspective. The particular variant of protein folding that we examine is known as the hydrophobic-hydrophilic (HP) model of protein folding on the integer lattice. This problem is known to be NP-hard and also maxSNP-hard. We examine various alternate formulations for the planar version of this problem and present some preliminary computational results. Hopefully, this sets the stage for a polyhedral combinatorics assault on this important problem.
dc.language.iso	en	en_US
dc.publisher	Indian Institute of Management Bangalore	-
dc.relation.ispartofseries	IIMB Working Paper-199	-
dc.subject	Protein folding problem	-
dc.subject	Integer linear programming	-
dc.subject	Hydrophobic-hydrophilic	-
dc.title	Protein folding on lattices: an integer programming approach	en_US
dc.type	Working Paper
dc.pages	15p.
dc.identifier.accession	E21449
Appears in Collections:	2002

File	Description	Size	Format
wp.iimb.199.pdf		1.51 MB	Adobe PDF	View/Open

Check