{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:30:33Z","timestamp":1725579033999},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642192210"},{"type":"electronic","value":"9783642192227"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-19222-7_27","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T08:03:12Z","timestamp":1300089792000},"page":"260-273","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Chaining of Seeds in Ordered Trees"],"prefix":"10.1007","author":[{"given":"Julien","family":"Allali","sequence":"first","affiliation":[]},{"given":"C\u00e9dric","family":"Chauve","sequence":"additional","affiliation":[]},{"given":"Pascal","family":"Ferraro","sequence":"additional","affiliation":[]},{"given":"Anne-Laure","family":"Gaillard","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Allali, J., Chauve, C., Ferraro, P., Gaillard, A.-L.: Efficient chaining of seeds in ordered trees. arXiv:1007.0942v1 [q-bio.QM] (2010)","DOI":"10.1007\/978-3-642-19222-7_27"},{"issue":"3","key":"27_CR2","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","volume":"215","author":"S.F. Altschul","year":"1990","unstructured":"Altschul, S.F., Gish, W., Miller, W., Myers, E.W., Lipman, D.J.: Basic local alignment search tool. J. Mol. Biol.\u00a0215(3), 403\u2013410 (1990)","journal-title":"J. Mol. Biol."},{"volume-title":"Handbook of Computational Molecular Biology","year":"2005","key":"27_CR3","unstructured":"Aluru, S. (ed.): Handbook of Computational Molecular Biology. CRC Press, Boca Raton (2005)"},{"issue":"4","key":"27_CR4","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":"27_CR5","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Mozes, S., Rossman, B., Weimann, O.: An optimal decomposition algorithm for tree edit distance. ACM Trans. Algorithms\u00a06(1), Article 2 (2009)","DOI":"10.1145\/1644015.1644017"},{"issue":"Database issue","key":"27_CR6","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1093\/nar\/gkn766","volume":"37","author":"P.P. Gardner","year":"2009","unstructured":"Gardner, P.P., Daub, J., Tate, J.G., et al.: Rfam: updates to the RNA families database. Nucleic Acids Res.\u00a037(Database issue), D136\u2013D140 (2009)","journal-title":"Nucleic Acids Res."},{"key":"27_CR7","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)"},{"issue":"16","key":"27_CR8","doi-asserted-by":"publisher","first-page":"2095","DOI":"10.1093\/bioinformatics\/btp065","volume":"25","author":"S. Heyne","year":"2009","unstructured":"Heyne, S., Will, S., Beckstette, M., Backofen, R.: Lightweight comparison of RNAs based on exact sequence-structure matches. Bioinformatics\u00a025(16), 2095\u20132102 (2009)","journal-title":"Bioinformatics"},{"issue":"2","key":"27_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. J. Comput. Biol.\u00a09(2), 371\u2013388 (2002)","journal-title":"J. Comput. Biol."},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/3-540-55706-7_29","volume-title":"Algorithm Theory - SWAT \u201992","author":"D. Joseph","year":"1992","unstructured":"Joseph, D., Meidanis, J., Tiwari, P.: Determining DNA sequence similarity using maximum independent set algorithms for interval graphs. In: Nurmi, O., Ukkonen, E. (eds.) SWAT 1992. LNCS, vol.\u00a0621, pp. 326\u2013337. Springer, Heidelberg (1992)"},{"issue":"4693","key":"27_CR11","doi-asserted-by":"publisher","first-page":"1435","DOI":"10.1126\/science.2983426","volume":"227","author":"D.J. Lipman","year":"1985","unstructured":"Lipman, D.J., Pearson, W.R.: Rapid and sensitive protein similarity searches. Science\u00a0227(4693), 1435\u20131441 (1985)","journal-title":"Science"},{"issue":"4","key":"27_CR12","first-page":"503","volume":"5","author":"A. Lozano","year":"2008","unstructured":"Lozano, A., Pinter, R.Y., Rokhlenko, O., Valiente, G., Ziv-Ukelson, M.: Seeded tree alignment. IEEE\/ACM TCBB\u00a05(4), 503\u2013513 (2008)","journal-title":"IEEE\/ACM TCBB"},{"key":"27_CR13","volume-title":"Handbook of Computational Molecular Biology","author":"E. Ohlebusch","year":"2005","unstructured":"Ohlebusch, E., Abouelhoda, M.I.: Chaining Algorithms and Applications in Comparative Genomics. In: Handbook of Computational Molecular Biology. CRC Press, Boca Raton (2005)"},{"issue":"8","key":"27_CR14","doi-asserted-by":"publisher","first-page":"2444","DOI":"10.1073\/pnas.85.8.2444","volume":"85","author":"W.R. Pearson","year":"1988","unstructured":"Pearson, W.R., Lipman, D.J.: Improved tools for biological sequence comparison. PNAS\u00a085(8), 2444\u20132448 (1988)","journal-title":"PNAS"},{"issue":"4","key":"27_CR15","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1371\/journal.pcbi.0020033","volume":"2","author":"J.S. Pedersen","year":"2006","unstructured":"Pedersen, J.S., et al.: Identification and classification of conserved RNA secondary structures in the human genome. PLoS Comput. Biol.\u00a02(4), e33 (2006)","journal-title":"PLoS Comput. Biol."},{"key":"27_CR16","first-page":"309","volume":"6","author":"B.A. Shapiro","year":"1990","unstructured":"Shapiro, B.A., Zhang, K.: Comparing multiple RNA secondary structures using tree comparisons. CABIOS\u00a06, 309\u2013318 (1990)","journal-title":"CABIOS"},{"issue":"6","key":"27_CR17","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","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19222-7_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T11:25:16Z","timestamp":1558437916000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19222-7_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642192210","9783642192227"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19222-7_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}