{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:35:10Z","timestamp":1725564910780},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223412"},{"type":"electronic","value":"9783540278016"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27801-6_18","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T23:00:15Z","timestamp":1283727615000},"page":"244-253","source":"Crossref","is-referenced-by-count":4,"title":["The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Berman","sequence":"first","affiliation":[]},{"given":"Bhaskar","family":"DasGupta","sequence":"additional","affiliation":[]},{"given":"Dhruv","family":"Mubayi","sequence":"additional","affiliation":[]},{"given":"Robert","family":"Sloan","sequence":"additional","affiliation":[]},{"given":"Gy\u00f6rgy","family":"Tur\u00e1n","sequence":"additional","affiliation":[]},{"given":"Yi","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1006\/jagm.1999.1062","volume":"34","author":"Y. Asahiro","year":"2000","unstructured":"Asahiro, Y., Iwama, K., Tamaki, H., Tokuyama, T.: Greedily Finding a Dense Subgraph. Journal of Algorithms\u00a034, 203\u2013221 (2000)","journal-title":"Journal of Algorithms"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0166-218X(01)00243-8","volume":"121","author":"Y. Asahiro","year":"2002","unstructured":"Asahiro, Y., Hassin, R., Iwama, K.: Complexity of finding dense subgraphs. Discrete Applied Mathematics\u00a0121, 15\u201326 (2002)","journal-title":"Discrete Applied Mathematics"},{"issue":"2-3","key":"18_CR3","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/PL00008278","volume":"25","author":"J. Atkins","year":"1999","unstructured":"Atkins, J., Hart, W.E.: On the intractability of protein folding with a finite alphabet of amino acids. Algorithmica\u00a025(2-3), 279\u2013294 (1999)","journal-title":"Algorithmica"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1002\/(SICI)1097-0134(19980401)31:1<10::AID-PROT2>3.0.CO;2-L","volume":"31","author":"J. Banavar","year":"1998","unstructured":"Banavar, J., Cieplak, M., Maritan, A., Nadig, G., Seno, F., Vishveshwara, S.: Structure-based design of model proteins. Proteins: Structure, Function, and Genetics\u00a031, 10\u201320 (1998)","journal-title":"Proteins: Structure, Function, and Genetics"},{"issue":"1","key":"18_CR5","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1089\/cmb.1998.5.27","volume":"5","author":"B. Berger","year":"1998","unstructured":"Berger, B., Leighton, T.: Protein folding in the hydrophobic-hydrophilic (HP) model is NP-complete. Journal of Computational Biology\u00a05(1), 27\u201340 (1998)","journal-title":"Journal of Computational Biology"},{"issue":"2","key":"18_CR6","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/S0196-6774(03)00015-4","volume":"47","author":"P. Berman","year":"2003","unstructured":"Berman, P., DasGupta, B., Muthukrishnan, S.: Approximation Algorithms For MAX-MIN Tiling. Journal of Algorithms\u00a047(2), 122\u2013134 (2003)","journal-title":"Journal of Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Crescenzi, P., Goldman, D., Papadimitriou, C., Piccolboni, A., Yannakakis, M.: On the complexity of protein folding. Journal of Computational Biology, 423\u2013466 (1998)","key":"18_CR7","DOI":"10.1089\/cmb.1998.5.423"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1103\/PhysRevLett.76.323","volume":"76","author":"J.M. Deutsch","year":"1996","unstructured":"Deutsch, J.M., Kurosky, T.: New algorithm for protein design. Physical Review Letters\u00a076, 323\u2013326 (1996)","journal-title":"Physical Review Letters"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1002\/pro.5560040401","volume":"4","author":"K.A. Dill","year":"1995","unstructured":"Dill, K.A., Bromberg, S., Yue, K., Fiebig, K.M., Yee, D.P., Thomas, P.D., Chan, H.S.: Principles of protein folding \u2014 A perspective from simple exact models. Protein Science\u00a04, 561\u2013602 (1995)","journal-title":"Protein Science"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"5275","DOI":"10.1073\/pnas.78.9.5275","volume":"78","author":"K.E. Drexler","year":"1981","unstructured":"Drexler, K.E.: Molecular engineering: An approach to the development of general capabilities for molecular manipulation. Proceedings of the National Academy of Sciences of the U.S.A.\u00a078, 5275\u20135278 (1981)","journal-title":"Proceedings of the National Academy of Sciences of the U.S.A."},{"unstructured":"Feige, U., Seltser, M.: On the densest k-subgraph problems. Technical Report # CS97-16, Faculty of Mathematics and Computer Science, Weizmann Institute of Science, Israel , available online at http:\/\/citeseer.nj.nec.com\/feige97densest.html","key":"18_CR11"},{"doi-asserted-by":"crossref","unstructured":"Hart, W.E.: On the computational complexity of sequence design problems. In: Proceedings of the 1st Annual International Conference on Computational Molecular Biology, pp. 128\u2013136 (1997)","key":"18_CR12","DOI":"10.1145\/267521.267539"},{"issue":"1","key":"18_CR13","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1089\/cmb.1996.3.53","volume":"3","author":"W.E. Hart","year":"1996","unstructured":"Hart, W.E., Istrail, S.: Fast protein folding in the hydrophobic-hydrophilic model within three-eighths of optimal. Journal of Computational Biology\u00a03(1), 53\u201396 (1996)","journal-title":"Journal of Computational Biology"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1007\/3-540-61258-0_21","volume-title":"Combinatorial Pattern Matching","author":"W.E. Hart","year":"1996","unstructured":"Hart, W.E., Istrail, S.: Invariant patterns in crystal lattices: Implications for protein folding algorithms (extended abstract). In: Hirschberg, D.S., Meyers, G. (eds.) CPM 1996. LNCS, vol.\u00a01075, pp. 288\u2013303. Springer, Heidelberg (1996)"},{"issue":"3","key":"18_CR15","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1089\/cmb.1997.4.241","volume":"4","author":"W.E. Hart","year":"1997","unstructured":"Hart, W.E., Istrail, S.: Lattice and off-lattice side chain models of protein folding: Linear time structure prediction better than 86% of optimal. Journal of Computational Biology\u00a04(3), 241\u2013260 (1997)","journal-title":"Journal of Computational Biology"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/3-540-48481-7_19","volume-title":"Algorithms - ESA\u201999","author":"V. Heun","year":"1999","unstructured":"Heun, V.: Approximate protein folding in the HP side chain model on extended cubic lattices. In: Ne\u0161et\u0159il, J. (ed.) ESA 1999. LNCS, vol.\u00a01643, pp. 212\u2013223. Springer, Heidelberg (1999)"},{"doi-asserted-by":"crossref","unstructured":"Hochbaum, D.: Approximation Algorithms for NP-hard problems. PWS Publishing Company (1997)","key":"18_CR17","DOI":"10.1145\/261342.571216"},{"issue":"1","key":"18_CR18","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"D.S. Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Mass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. Journal of ACM\u00a032(1), 130\u2013136 (1985)","journal-title":"Journal of ACM"},{"doi-asserted-by":"crossref","unstructured":"Kleinberg, J.: Efficient Algorithms for Protein Sequence Design and the Analysis of Certain Evolutionary Fitness Landscapes.In: Proceedings of the 3rd Annual International Conference on Computational Molecular Biology,pp. 226-237 (1999)","key":"18_CR19","DOI":"10.1145\/299432.299487"},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"3986","DOI":"10.1021\/ma00200a030","volume":"22","author":"K.F. Lau","year":"1989","unstructured":"Lau, K.F., Dill, K.A.: A lattice statistical mechanics model of the conformational and sequence spaces of proteins. Macromolecules\u00a022, 3986\u20133997 (1989)","journal-title":"Macromolecules"},{"unstructured":"Mauri, G., Pavesi, G., Piccolboni, A.: Approximation algorithms for protein folding prediction. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 945\u2013946 (1999)","key":"18_CR21"},{"key":"18_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-6831-1","volume-title":"The Protein Folding Problem and Tertiary Structure Prediction","author":"K.M. Merz","year":"1994","unstructured":"Merz, K.M., Grand, S.M.L.: The Protein Folding Problem and Tertiary Structure Prediction. Birkhauser, Boston (1994)"},{"key":"18_CR23","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0022-2836(87)90358-5","volume":"193","author":"J. Ponder","year":"1987","unstructured":"Ponder, J., Richards, F.M.: Tertiary templates for proteins. Journal of Molecular Biology\u00a0193, 63\u201389 (1987)","journal-title":"Journal of Molecular Biology"},{"issue":"12","key":"18_CR24","doi-asserted-by":"publisher","first-page":"1205","DOI":"10.1093\/protein\/8.12.1205","volume":"8","author":"S.J. Sun","year":"1995","unstructured":"Sun, S.J., Brem, R., Chan, H.S., Dill, K.A.: Designing amino acid sequences to fold with good hydrophobic cores. Protein Engineering\u00a08(12), 1205\u20131213 (1995)","journal-title":"Protein Engineering"},{"key":"18_CR25","doi-asserted-by":"publisher","first-page":"7195","DOI":"10.1073\/pnas.90.15.7195","volume":"90","author":"E.I. Shakhnovich","year":"1993","unstructured":"Shakhnovich, E.I., Gutin, A.M.: Engineering of stable and fast-folding sequences of model proteins. Proc. Natl. Acad. Sci.\u00a090, 7195\u20137199 (1993)","journal-title":"Proc. Natl. Acad. Sci."},{"doi-asserted-by":"crossref","unstructured":"Smith, T.F., Conte, L.L., Bienkowska, J., Rogers, B., Gaitatzes, C., Lathrop, R.H.: The threading approach to the inverse protein folding problem. In: Proceedings of the 1st Annual International Conference on Computational Molecular Biology, pp. 287\u2013292 (1997)","key":"18_CR26","DOI":"10.1145\/267521.267887"},{"doi-asserted-by":"crossref","unstructured":"Yue, K., Dill, K.A.: Inverse protein folding problem: Designing polymer sequences. In: Proceedings of the National Academy of Sciences of the U.S.A., vol.\u00a089, pp. 4163\u20134167 (1992)","key":"18_CR27","DOI":"10.1073\/pnas.89.9.4163"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27801-6_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:21:27Z","timestamp":1605759687000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27801-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223412","9783540278016"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27801-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}