{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:53:44Z","timestamp":1743000824931,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030629991"},{"type":"electronic","value":"9783030630003"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-63000-3_3","type":"book-chapter","created":{"date-parts":[[2020,11,30]],"date-time":"2020-11-30T00:03:23Z","timestamp":1606694603000},"page":"36-41","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Solving Hard Problems by Protein Folding?"],"prefix":"10.1007","author":[{"given":"Andrzej","family":"Lingas","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,11,30]]},"reference":[{"key":"3_CR1","volume-title":"Elements of Physical Chemistry","author":"P Atkins","year":"2005","unstructured":"Atkins, P., de Paula, J.: Elements of Physical Chemistry, 4th edn. Oxford University Press, Oxford (2005)","edition":"4"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Berger, B., Leighton, T.: Protein folding in the hydrophobic-hydrophilic (HP) model is NP-complete. In: Proceedings of the RECOMB 1998, New York (1998)","DOI":"10.1145\/279069.279080"},{"issue":"3","key":"3_CR3","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1089\/cmb.1998.5.423","volume":"5","author":"P Crescenzi","year":"1998","unstructured":"Crescenzi, P., Goldman, D., Papadimitriou, C.H., Piccolboni, A., Yannakakis, M.: On the complexity of protein folding. J. Comput. Biol. 5(3), 423\u2013466 (1998)","journal-title":"J. Comput. Biol."},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-540-27810-8_22","volume-title":"Algorithm Theory - SWAT 2004","author":"A Dessmark","year":"2004","unstructured":"Dessmark, A., Lingas, A., Lundell, E.-M.: Subexponential-time framework for optimal embeddings of graphs in integer lattices. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, pp. 248\u2013259. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27810-8_22"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"1501","DOI":"10.1021\/bi00327a032","volume":"24","author":"KA Dill","year":"1985","unstructured":"Dill, K.A.: Theory for the folding and stability of globular proteins. Biochemistry 24, 1501 (1985)","journal-title":"Biochemistry"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1007\/978-3-540-27836-8_54","volume-title":"Automata, Languages and Programming","author":"B Fu","year":"2004","unstructured":"Fu, B., Wang, W.: A $$2^{O(n^{1-{1\\over d}}\\log n)}$$ time algorithm for d-dimensional protein folding in the HP-model. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 630\u2013644. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27836-8_54"},{"key":"3_CR7","unstructured":"Irb\u00e4ck., A.: Personal communication, 2019 December"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1051\/jcp\/1968650044","volume":"65","author":"C Levinthal","year":"1968","unstructured":"Levinthal, C.: Are there pathways for protein folding? Journal de Chimie Physique et de Physico-Chimie Biologique 65, 44\u201345 (1968)","journal-title":"Journal de Chimie Physique et de Physico-Chimie Biologique"},{"key":"3_CR9","unstructured":"Mauri, G., Pavesi, G., Piccolboni, A.: Approximation algorithms for protein folding prediction. In: Proceedings of the SODA 1999, pp. S945\u2013S946 (1999)"},{"key":"3_CR10","unstructured":"Nayak, A., Sinclair, A., Zwick, U.: Spatial codes and the hardness of string folding problems (extended abstract). In: Proceedings of the SODA 1998, pp. 639\u2013648 (1998)"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1007\/3-540-61440-0_167","volume-title":"Automata, Languages and Programming","author":"M Paterson","year":"1996","unstructured":"Paterson, M., Przytycka, T.: On the complexity of string folding. In: Meyer, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 658\u2013669. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61440-0_167"}],"container-title":["Lecture Notes in Computer Science","Theory and Practice of Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-63000-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,30]],"date-time":"2020-11-30T00:04:02Z","timestamp":1606694642000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-63000-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030629991","9783030630003"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-63000-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"30 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TPNC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Practice of Natural Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taoyuan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tpnc2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/irdta.eu\/tpnc2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"An invited paper is also included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}