{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:55:40Z","timestamp":1725569740987},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642169250"},{"type":"electronic","value":"9783642169267"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16926-7_23","type":"book-chapter","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T02:48:26Z","timestamp":1289357306000},"page":"244-255","source":"Crossref","is-referenced-by-count":1,"title":["Parameterized Complexity of the Arc-Preserving Subsequence Problem"],"prefix":"10.1007","author":[{"given":"D\u00e1niel","family":"Marx","sequence":"first","affiliation":[]},{"given":"Ildik\u00f3","family":"Schlotter","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2-3","key":"23_CR1","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/j.tcs.2003.10.026","volume":"312","author":"J. Alber","year":"2004","unstructured":"Alber, J., Gramm, J., Guo, J., Niedermeier, R.: Computing the similarity of two sequences with nested arc annotations. Theor. Comput. Sci.\u00a0312(2-3), 337\u2013358 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1007\/11428848_110","volume-title":"Computational Science \u2013 ICCS 2005","author":"G. Blin","year":"2005","unstructured":"Blin, G., Fertin, G., Rizzi, R., Vialette, S.: What makes the Arc-Preserving Subsequence problem hard? In: Sunderam, V.S., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2005. LNCS, vol.\u00a03515, pp. 860\u2013868. Springer, Heidelberg (2005)"},{"issue":"2","key":"23_CR3","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.ipl.2006.05.008","volume":"100","author":"P. Damaschke","year":"2006","unstructured":"Damaschke, P.: A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs. Inf. Process. Lett.\u00a0100(2), 64\u201368 (2006)","journal-title":"Inf. Process. Lett."},{"key":"23_CR4","series-title":"Monographs in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, New York (1999)"},{"key":"23_CR5","unstructured":"Evans, P.A.: Algorithms and complexity for annotated sequence analysis. PhD thesis, University of Victoria, Canada (1999)"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/3-540-48452-3_20","volume-title":"Combinatorial Pattern Matching","author":"P.A. Evans","year":"1999","unstructured":"Evans, P.A.: Finding common subsequences with arcs and pseudoknots. In: Crochemore, M., Paterson, M. (eds.) CPM 1999. LNCS, vol.\u00a01645, pp. 270\u2013280. Springer, Heidelberg (1999)"},{"key":"23_CR7","series-title":"An EATCS Series","first-page":"493","volume-title":"Texts in Theoretical Computer Science","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. In: Texts in Theoretical Computer Science. An EATCS Series, p. 493. Springer, Heidelberg (2006)"},{"issue":"1","key":"23_CR8","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1145\/1125994.1125997","volume":"2","author":"J. Gramm","year":"2006","unstructured":"Gramm, J., Guo, J., Niedermeier, R.: Pattern matching for arc-annotated sequences. ACM Trans. Algorithms\u00a02(1), 44\u201365 (2006)","journal-title":"ACM Trans. Algorithms"},{"issue":"2","key":"23_CR9","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S1570-8667(03)00080-7","volume":"2","author":"T. Jiang","year":"2004","unstructured":"Jiang, T., Lin, G., Ma, B., Zhang, K.: The longest common subsequence problem for arc-annotated sequences. J. Discrete Algorithms\u00a02(2), 257\u2013270 (2004)","journal-title":"J. Discrete Algorithms"},{"issue":"3","key":"23_CR10","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/S0022-0000(02)00004-1","volume":"65","author":"G. Lin","year":"2002","unstructured":"Lin, G., Chen, Z.-Z., Jiang, T., Wen, J.: The longest common subsequence problem for sequences with nested arc annotations. J. Comput. Syst. Sci.\u00a065(3), 465\u2013480 (2002)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1-2","key":"23_CR11","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0304-3975(01)00192-X","volume":"276","author":"B. Ma","year":"2002","unstructured":"Ma, B., Wang, L., Zhang, K.: Computing similarity between RNA structures. Theor. Comput. Sci.\u00a0276(1-2), 111\u2013132 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR12","unstructured":"Marx, D., Schlotter, I.: Cleaning interval graphs. CoRR\u00a0abs\/1003.1260 (2010) arXiv:1003.1260 [cs.DS]"}],"container-title":["Lecture Notes in Computer Science","Graph Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16926-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T00:26:29Z","timestamp":1553214389000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16926-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642169250","9783642169267"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16926-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}