{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:35:14Z","timestamp":1742380514764},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540297406"},{"type":"electronic","value":"9783540322412"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11575832_38","type":"book-chapter","created":{"date-parts":[[2005,10,13]],"date-time":"2005-10-13T14:12:50Z","timestamp":1129212770000},"page":"335-347","source":"Crossref","is-referenced-by-count":19,"title":["An Edit Distance Between RNA Stem-Loops"],"prefix":"10.1007","author":[{"given":"Valentin","family":"Guignon","sequence":"first","affiliation":[]},{"given":"Cedric","family":"Chauve","sequence":"additional","affiliation":[]},{"given":"Sylvie","family":"Hamel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"38_CR1","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TCBB.2005.2","volume":"2","author":"J. Allali","year":"2005","unstructured":"Allali, J., Sagot, M.-F.: A new distance for high level RNA secondary structure comparison. IEEE\/ACM Transactions on Computational Biology and Bioinformatics\u00a02(1), 4\u201314 (2005)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"issue":"4","key":"38_CR2","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1142\/S0219720004000818","volume":"2","author":"R. Backofen","year":"2004","unstructured":"Backofen, R., Will, S.: Local sequence-structure motifs in RNA. J. Bioinform. Comput. Biol.\u00a02(4), 681\u2013698 (2004)","journal-title":"J. Bioinform. Comput. Biol."},{"key":"38_CR3","unstructured":"Blin, G., Fertin, G., Sinoquet, C.: RNA sequences and the EDIT(NESTED, NESTED) problem. Report RR-IRIN-03.07, IRIN, Nantes, France (2003)"},{"key":"38_CR4","doi-asserted-by":"publisher","first-page":"2296","DOI":"10.1126\/science.298.5602.2296","volume":"298","author":"J. Couzin","year":"2002","unstructured":"Couzin, J.: Breakthrough of the year: small RNAs make big splash. Science\u00a0298, 2296\u20132297 (2002)","journal-title":"Science"},{"key":"38_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on strings, trees and sequences","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on strings, trees and sequences. Cambridge University Press, Cambridge (1997)"},{"key":"38_CR6","first-page":"159","volume-title":"2nd IEEE Computer Society Bioinformatics Conference (CSB 2003)","author":"M. H\u00f6chsmann","year":"2003","unstructured":"H\u00f6chsmann, M., T\u00f6ller, T., Giegerich, R., Kurtz, S.: Local similarity in RNA secondary structures. In: 2nd IEEE Computer Society Bioinformatics Conference (CSB 2003), pp. 159\u2013169. IEEE Computer Society, Los Alamitos (2003)"},{"issue":"13","key":"38_CR7","doi-asserted-by":"publisher","first-page":"3429","DOI":"10.1093\/nar\/gkg599","volume":"31","author":"I.L. Hofacker","year":"2003","unstructured":"Hofacker, I.L.: Vienna RNA secondary structure server. Nucleic Acids Res.\u00a031(13), 3429\u20133431 (2003)","journal-title":"Nucleic Acids Res."},{"issue":"2","key":"38_CR8","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. J. Comput. Biol.\u00a09(2), 371\u2013388 (2002)","journal-title":"J. Comput. Biol."},{"issue":"4","key":"38_CR9","first-page":"309","volume":"6","author":"B.A. Shapiro","year":"1988","unstructured":"Shapiro, B.A., Zhang, K.: Comparing multiple RNA secondary structures using tree comparisons. Comput. Appl. Biosci.\u00a06(4), 309\u2013318 (1988)","journal-title":"Comput. Appl. Biosci."},{"issue":"6","key":"38_CR10","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 J. Comput.\u00a018(6), 1245\u20131262 (1989)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11575832_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:42:57Z","timestamp":1619505777000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11575832_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540297406","9783540322412"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11575832_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}