{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:12:29Z","timestamp":1725541949326},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642112652"},{"type":"electronic","value":"9783642112669"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11266-9_16","type":"book-chapter","created":{"date-parts":[[2009,12,7]],"date-time":"2009-12-07T14:04:58Z","timestamp":1260194698000},"page":"188-199","source":"Crossref","is-referenced-by-count":1,"title":["Fast Arc-Annotated Subsequence Matching in Linear Space"],"prefix":"10.1007","author":[{"given":"Philip","family":"Bille","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Inge Li","family":"G\u00f8rtz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2-3","key":"16_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":"16_CR2","doi-asserted-by":"crossref","unstructured":"Backofen, R., Landau, G.M., M\u00f6hl, M., Tsur, D., Weimann, O.: Fast RNA Structure Alignment for Crossing Input Structures. In: Proc. 20th\u00a0CPM (2009)","DOI":"10.1007\/978-3-642-02441-2_21"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Combinatorial Pattern Matching","author":"V. Bafna","year":"1995","unstructured":"Bafna, V., Muthukrishnan, S., Ravi, R.: Computing Similarity between RNA Strings. In: Galil, Z., Ukkonen, E. (eds.) CPM 1995. LNCS, vol.\u00a0937, pp. 1\u201316. Springer, Heidelberg (1995)"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1007\/11523468_6","volume-title":"Automata, Languages and Programming","author":"P. Bille","year":"2005","unstructured":"Bille, P., G\u00f8rtz, I.L.: The Tree Inclusion Problem: In Optimal Space and Faster. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 66\u201377. Springer, Heidelberg (2005)"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Blin, G., Fertin, G., Rizzi, R., Vialette, S.: What Makes the Arc-Preserving Subsequence Problem Hard? In: Proc. 5th\u00a0ICCS, pp. 860\u2013868 (2005)","DOI":"10.1007\/11428848_110"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/11880561_24","volume-title":"String Processing and Information Retrieval","author":"G. Blin","year":"2006","unstructured":"Blin, G., Touzet, H.: How to Compare Arc-Annotated Sequences: The Alignment Hierarchy. In: Crestani, F., Ferragina, P., Sanderson, M. (eds.) SPIRE 2006. LNCS, vol.\u00a04209, pp. 291\u2013303. Springer, Heidelberg (2006)"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1006\/jagm.1997.0899","volume":"26","author":"W. Chen","year":"1998","unstructured":"Chen, W.: More Efficient Algorithm for Ordered Tree Inclusion. J. Algorithms\u00a026, 370\u2013385 (1998)","journal-title":"J. Algorithms"},{"issue":"2","key":"16_CR8","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":"16_CR9","unstructured":"Evans, P.: Algorithms and Complexity for Annotated Sequence Analysis. PhD Thesis, University of Victoria (1999)"},{"key":"#cr-split#-16_CR10.1","doi-asserted-by":"crossref","unstructured":"Gramm, J., Guo, J., Niedermeier, R.: Pattern Matching for Arc-Annotated Sequences. ACM Trans. Algorithms 2(1), 44\u201365 (2006);","DOI":"10.1145\/1125994.1125997"},{"key":"#cr-split#-16_CR10.2","unstructured":"Announced at: Agrawal, M., Seth, A.K. (eds.) FSTTCS 2002. LNCS, vol.\u00a02556, pp. 182\u2013193. Springer, Heidelberg (2002)"},{"issue":"2","key":"16_CR11","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast Algorithms for Finding Nearest Common Ancestors. SIAM J. Comput.\u00a013(2), 338\u2013355 (1984)","journal-title":"SIAM J. Comput."},{"key":"16_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/11605126_2","volume-title":"Federation over the Web","author":"T. Kida","year":"2006","unstructured":"Kida, T.: Faster Pattern Matching Algorithm for Arc-Annotated Sequences. In: Jantke, K.P., Lunzer, A., Spyratos, N., Tanaka, Y. (eds.) Federation over the Web. LNCS (LNAI), vol.\u00a03847, pp. 25\u201339. Springer, Heidelberg (2006)"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1137\/S0097539791218202","volume":"24","author":"P. Kilpel\u00e4inen","year":"1995","unstructured":"Kilpel\u00e4inen, P., Mannila, H.: Ordered and Unordered Tree Inclusion. SIAM J. Comput.\u00a024, 340\u2013356 (1995)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"16_CR14","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."},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/3-540-62034-6_35","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"I. Munro","year":"1996","unstructured":"Munro, I.: Tables. In: Chandru, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol.\u00a01180, pp. 37\u201342. Springer, Heidelberg (1996)"},{"key":"#cr-split#-16_CR16.1","doi-asserted-by":"crossref","unstructured":"Vialette, S.: On the Computational Complexity of 2-Interval Pattern Matching Problems. Theor. Comput. Sci.\u00a0312(2-3), 223\u2013249 (2004);","DOI":"10.1016\/j.tcs.2003.08.010"},{"key":"#cr-split#-16_CR16.2","unstructured":"Announced at CPM 2002"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2010: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11266-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T08:45:11Z","timestamp":1558687511000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11266-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642112652","9783642112669"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11266-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}