{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:20:14Z","timestamp":1743063614656,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030202415"},{"type":"electronic","value":"9783030202422"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-20242-2_21","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T14:34:37Z","timestamp":1558362877000},"page":"244-256","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Maximum Stacking Base Pairs: Hardness and Approximation by Nonlinear LP-Rounding"],"prefix":"10.1007","author":[{"given":"Lixin","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haitao","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peiqiang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binhai","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daming","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,9]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1006\/jmbi.1999.3001","volume":"293","author":"I Tinoco Jr","year":"1999","unstructured":"Tinoco Jr., I., Bustamante, C.: How RNA folds. J. Mol. Biol. 293, 271\u2013281 (1999)","journal-title":"J. Mol. Biol."},{"issue":"1","key":"21_CR2","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1137\/0135006","volume":"35","author":"R Nussinov","year":"1978","unstructured":"Nussinov, R., Pieczenik, G., Griggs, J.R., Kleitman, D.J.: Algorithms for loop matchings. SIAM J. Appl. Math. 35(1), 68\u201382 (1978)","journal-title":"SIAM J. Appl. Math."},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"6309","DOI":"10.1073\/pnas.77.11.6309","volume":"77","author":"R Nussinov","year":"1980","unstructured":"Nussinov, R., Jacobson, A.B.: Fast algorithm for predicting the secondary structure of single-stranded RNA. Proc. Natl. Acad. Sci. USA 77, 6309\u20136313 (1980)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1093\/nar\/9.1.133","volume":"9","author":"M Zuker","year":"1981","unstructured":"Zuker, M., Stiegler, P.: Optimal computer folding of large RNA sequences using thermodynamics and auxiliary information. Nucleic Acids Res. 9, 133\u2013148 (1981)","journal-title":"Nucleic Acids Res."},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/BF02459506","volume":"46","author":"M Zuker","year":"1984","unstructured":"Zuker, M., Sankoff, D.: RNA secondary structures and their prediction. Bull. Math. Biol. 46, 591\u2013621 (1984)","journal-title":"Bull. Math. Biol."},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1137\/0145048","volume":"45","author":"D Sankoff","year":"1985","unstructured":"Sankoff, D.: Simultaneous solution of the RNA folding, alignment and protosequence problems. SIAM J. Appl. Math. 45, 810\u2013825 (1985)","journal-title":"SIAM J. Appl. Math."},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1093\/bioinformatics\/15.6.440","volume":"15","author":"RB Lyngs\u00f8","year":"1999","unstructured":"Lyngs\u00f8, R.B., Zuker, M., Pedersen, C.N.S.: Fast evaluation of interval loops in RNA secondary structure prediction. Bioinformatics 15, 440\u2013445 (1999)","journal-title":"Bioinformatics"},{"issue":"3\/4","key":"21_CR8","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1089\/106652700750050862","volume":"7","author":"RB Lyngs\u00f8","year":"2000","unstructured":"Lyngs\u00f8, R.B., Pedersen, C.N.S.: RNA pseudoknot prediction in energy based models. J. Comput. Biol. 7(3\/4), 409\u2013427 (2000)","journal-title":"J. Comput. Biol."},{"issue":"1\u20133","key":"21_CR9","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0166-218X(00)00186-4","volume":"104","author":"T Akutsu","year":"2000","unstructured":"Akutsu, T.: Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots. Discrete Appl. Math. 104(1\u20133), 45\u201362 (2000)","journal-title":"Discrete Appl. Math."},{"issue":"5","key":"21_CR10","doi-asserted-by":"publisher","first-page":"2053","DOI":"10.1006\/jmbi.1998.2436","volume":"285","author":"E Rivas","year":"1999","unstructured":"Rivas, E., Eddy, S.R.: A dynamic programming algorithm for RNA structure prediction including pseudoknots. J. Mol. Biol. 285(5), 2053\u20132068 (1999)","journal-title":"J. Mol. Biol."},{"issue":"2","key":"21_CR11","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0304-3975(98)00090-5","volume":"210","author":"Y Uemura","year":"1999","unstructured":"Uemura, Y., Hasegawa, A., Kobayashi, S., Yokomori, T.: Tree adjoining grammars for RNA structure prediction. Theor. Comput. Sci. 210(2), 277\u2013303 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1038\/newbio246040a0","volume":"246","author":"I Tinoco Jr","year":"1973","unstructured":"Tinoco Jr., I., et al.: Improved estimation of secondary structure in ribonucleic acids. Nat. New Biol. 246, 40\u201342 (1973)","journal-title":"Nat. New Biol."},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1089\/106652703322756186","volume":"10","author":"S Ieong","year":"2003","unstructured":"Ieong, S., Kao, M.-Y., Lam, T.-W., Sung, W.-K., Yiu, S.-M.: Predicting RNA secondary structure with arbitrary pseudoknots by maximizing the number of stacking pairs. J. Comput. Biol. 10, 981\u2013995 (2003)","journal-title":"J. Comput. Biol."},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1007\/978-3-540-27836-8_77","volume-title":"Automata, Languages and Programming","author":"RB Lyngs\u00f8","year":"2004","unstructured":"Lyngs\u00f8, R.B.: Complexity of pseudoknot prediction in simple models. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 919\u2013931. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27836-8_77"},{"issue":"2","key":"21_CR15","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1109\/TCBB.2008.109","volume":"7","author":"M Jiang","year":"2010","unstructured":"Jiang, M.: Approximation algorithms for predicting RNA secondary structures with arbitrary pseudoknots. IEEE\/ACM Trans. Comput. Biol. Bioinform. 7(2), 323\u2013332 (2010)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"21_CR16","first-page":"178","volume":"7","author":"P Berman","year":"2000","unstructured":"Berman, P.: A $$d$$\/2 approximation for maximum weight independent set in $$d$$-Claw free graphs. Nordic J. Comput. 7, 178\u2013184 (2000)","journal-title":"Nordic J. Comput."},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-319-71150-8_7","volume-title":"Combinatorial Optimization and Applications","author":"A Zhou","year":"2017","unstructured":"Zhou, A., Jiang, H., Guo, J., Zhu, D.: A new approximation algorithm for the maximum stacking base pairs problem from RNA secondary structures prediction. In: Gao, X., Du, H., Han, M. (eds.) COCOA 2017. LNCS, vol. 10627, pp. 85\u201392. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71150-8_7"},{"key":"21_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-48523-6_17","volume-title":"Automata, Languages and Programming","author":"P Berman","year":"1999","unstructured":"Berman, P., Karpinski, M.: On some tighter inapproximability results (extended abstract). In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 200\u2013209. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48523-6_17"}],"container-title":["Lecture Notes in Computer Science","Bioinformatics Research and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-20242-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:18:24Z","timestamp":1710335904000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-20242-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030202415","9783030202422"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-20242-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"9 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISBRA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Bioinformatics Research and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Barcelona","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isbra2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/alan.cs.gsu.edu\/isbra19\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}