Approximation Algorithms for Protein Folding Prediction (short) Export

@inproceedings{hp5, abstract = {We present a new polynomial-time algorithm for the protein folding problem in the two-dimensional HP model introduced by Dill [1], which has been recently proved to be NP-hard [2]. The model abstracts one of the dominant forces of protein folding: the hydrophobic-hydrophilic interaction. Thus, proteins are modeled as binary strings on the alphabet fH, Pg, representing chains of hydrophobic and hydrophilic monomers. The problem is to find, given a string s, the two-dimensional structure that...}, author = {Mauri and Pavesi and Piccolboni}, booktitle = {SODA: {ACM}-{SIAM} Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms)}, citeulike-article-id = {2599824}, citeulike-linkout-0 = {http://citeseer.ist.psu.edu/mauri99approximation.html}, citeulike-linkout-1 = {http://citeseer.lcs.mit.edu/mauri99approximation.html}, citeulike-linkout-2 = {http://citeseer.ifi.unizh.ch/mauri99approximation.html}, citeulike-linkout-3 = {http://citeseer.comp.nus.edu.sg/mauri99approximation.html}, keywords = {hp-model}, posted-at = {2008-03-26 21:38:18}, priority = {2}, title = {Approximation Algorithms for Protein Folding Prediction (short)}, url = {http://citeseer.ist.psu.edu/mauri99approximation.html}, year = {1999} }

TY - CONF ID - hp5 L3 - citeulike-article-id:2599824 N2 - We present a new polynomial-time algorithm for the protein folding problem in the two-dimensional HP model introduced by Dill [1], which has been recently proved to be NP-hard [2]. The model abstracts one of the dominant forces of protein folding: the hydrophobic-hydrophilic interaction. Thus, proteins are modeled as binary strings on the alphabet fH, Pg, representing chains of hydrophobic and hydrophilic monomers. The problem is to find, given a string s, the two-dimensional structure that... TI - Approximation Algorithms for Protein Folding Prediction (short) T2 - SODA: {ACM}-{SIAM} Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms) KW - hp-model AU - Mauri AU - Pavesi AU - Piccolboni PY - 1999/// UR - http://citeseer.ist.psu.edu/mauri99approximation.html ER -