{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:25Z","timestamp":1725544045468},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114397"},{"type":"electronic","value":"9783642114403"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11440-3_14","type":"book-chapter","created":{"date-parts":[[2010,2,2]],"date-time":"2010-02-02T16:03:36Z","timestamp":1265126616000},"page":"149-160","source":"Crossref","is-referenced-by-count":1,"title":["Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions"],"prefix":"10.1007","author":[{"given":"Guillaume","family":"Blin","sequence":"first","affiliation":[]},{"given":"Sylvie","family":"Hamel","sequence":"additional","affiliation":[]},{"given":"St\u00e9phane","family":"Vialette","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2-3","key":"14_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. Theoretical Computer Science\u00a0312(2-3), 337\u2013358 (2004)","journal-title":"Theoretical Computer Science"},{"key":"14_CR2","unstructured":"Blin, G., Denise, A., Dulucq, S., Herrbach, C., Touzet, H.: Alignment of RNA structures. IEEE\/ACM Transactions on Computational Biology and Bioinformatics (2008) (to appear)"},{"key":"14_CR3","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-540-73731-5_10","volume-title":"Advances in Bioinformatics and Computational Biology","author":"G. Blin","year":"2007","unstructured":"Blin, G., Fertin, G., Herry, G., Vialette, S.: Comparing RNA structures: Towards an intermediate model between the edit and the lapcs problems. In: Sagot, M.-F., Walter, M.E.M.T. (eds.) BSB 2007. LNCS (LNBI), vol.\u00a04643, pp. 101\u2013112. Springer, Heidelberg (2007)"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-540-74450-4_13","volume-title":"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies","author":"G. Blin","year":"2007","unstructured":"Blin, G., Fertin, G., Rusu, I., Sinoquet, C.: Extending the hardness of RNA secondary structure comparison. In: Chen, B., Paterson, M., Zhang, G. (eds.) ESCAPE 2007. LNCS, vol.\u00a04614, pp. 140\u2013151. Springer, Heidelberg (2007)"},{"key":"14_CR5","unstructured":"Evans, P.: Algorithms and Complexity for Annotated Sequences Analysis. PhD thesis, University of Victoria (1999)"},{"key":"14_CR6","volume-title":"Computers and Intractability: a guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: a guide to the theory of NP-completeness. W.H.\u00a0Freeman, New York (1979)"},{"issue":"1","key":"14_CR7","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 Transactions on Algorithms\u00a02(1), 44\u201365 (2006) (to appear)","journal-title":"ACM Transactions on Algorithms"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/11575832_38","volume-title":"String Processing and Information Retrieval","author":"V. Guignon","year":"2005","unstructured":"Guignon, V., Chauve, C., Hamel, S.: An edit distance between RNA stem-loops. In: Consens, M.P., Navarro, G. (eds.) SPIRE 2005. LNCS, vol.\u00a03772, pp. 335\u2013347. Springer, Heidelberg (2005)"},{"issue":"2","key":"14_CR9","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1089\/10665270252935511","volume":"9","author":"T. Jiang","year":"2002","unstructured":"Jiang, T., Lin, G., Ma, B., Zhang, K.: A general edit distance between RNA structures. Journal of Computational Biology\u00a09(2), 371\u2013388 (2002)","journal-title":"Journal of Computational Biology"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Jiang, T., Lin, G., Ma, B., Zhang, K.: The longest common subsequence problem for arc-annotated sequences. Journal of Dicrete Algorithms, 257\u2013270 (2004)","DOI":"10.1016\/S1570-8667(03)00080-7"},{"key":"14_CR11","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. Journal of Computer and System Sciences\u00a065, 465\u2013480 (2002)","journal-title":"Journal of Computer and System Sciences"},{"issue":"6","key":"14_CR12","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"K. Zhang","year":"1989","unstructured":"Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal of Computing\u00a018(6), 1245\u20131262 (1989)","journal-title":"SIAM Journal of Computing"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11440-3_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:40:30Z","timestamp":1606185630000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11440-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114397","9783642114403"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11440-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}