{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T03:27:57Z","timestamp":1725593277329},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642214578"},{"type":"electronic","value":"9783642214585"}],"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-21458-5_11","type":"book-chapter","created":{"date-parts":[[2011,6,27]],"date-time":"2011-06-27T21:11:27Z","timestamp":1309209087000},"page":"104-117","source":"Crossref","is-referenced-by-count":9,"title":["Forest Alignment with Affine Gaps and Anchors"],"prefix":"10.1007","author":[{"given":"Stefanie","family":"Schirmer","sequence":"first","affiliation":[]},{"given":"Robert","family":"Giegerich","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","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: Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching, pp. 236\u2013248 (2009)","DOI":"10.1007\/978-3-642-02441-2_21"},{"key":"11_CR2","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":"11_CR3","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1186\/1471-2105-11-222","volume":"11","author":"A. Bremges","year":"2010","unstructured":"Bremges, A., Schirmer, S., Giegerich, R.: Fine-tuning structural RNA alignments in the twilight zone. BMC Bioinformatics\u00a011, 222 (2010)","journal-title":"BMC Bioinformatics"},{"issue":"16","key":"11_CR4","doi-asserted-by":"publisher","first-page":"4843","DOI":"10.1093\/nar\/gkh779","volume":"32","author":"R. Giegerich","year":"2004","unstructured":"Giegerich, R., Voss, B., Rehmsmeier, M.: Abstract shapes of RNA. Nucleic Acids Research\u00a032(16), 4843\u20134851 (2004)","journal-title":"Nucleic Acids Research"},{"issue":"2","key":"11_CR5","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1109\/TCBB.2010.12","volume":"8","author":"R. Giegerich","year":"2011","unstructured":"Giegerich, R., H\u00f6ner zu Siederdissen, C.: Semantics and Ambiguity of Stochastic RNA Family Models. IEEE\/ACM Transactions on Computational Biology and Bioinformatics\u00a08(2), 499\u2013516 (2011), DOI, \n                    \n                      http:\/\/doi.ieeecomputersociety.org\/10.1109\/TCBB.2010.12","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"issue":"3","key":"11_CR6","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1016\/0022-2836(82)90398-9","volume":"162","author":"O. Gotoh","year":"1982","unstructured":"Gotoh, O.: An improved algorithm for matching biological sequences. J. Mol. Biol.\u00a0162(3), 705\u2013708 (1982)","journal-title":"J. Mol. Biol."},{"key":"11_CR7","first-page":"159","volume":"2","author":"M. Hoechsmann","year":"2003","unstructured":"Hoechsmann, M., Toeller, T., Giegerich, R., Kurtz, S.: Local similarity in RNA secondary structures. Proc. IEEE Comput. Soc. Bioinform. Conf.\u00a02, 159\u2013168 (2003)","journal-title":"Proc. IEEE Comput. Soc. Bioinform. Conf."},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/TCBB.2004.11","volume":"1","author":"M. Hoechsmann","year":"2004","unstructured":"Hoechsmann, M., Voss, B., Giegerich, R.: Pure multiple RNA secondary structure alignments: A progressive profile approach. IEEE\/ACM Transactions on Computational Biology and Bioinformatics\u00a01, 53\u201362 (2004)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"issue":"2","key":"11_CR9","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF00818163","volume":"125","author":"I.L. Hofacker","year":"1994","unstructured":"Hofacker, I.L., Fontana, W., Stadler, P.F., Bonhoeffer, L.S., Tacker, M., Schuster, P.: Fast folding and comparison of RNA secondary structures. Monatshefte f\u00fcr Chemie \/ Chemical Monthly\u00a0125(2), 167\u2013188 (1994)","journal-title":"Monatshefte f\u00fcr Chemie \/ Chemical Monthly"},{"issue":"1","key":"11_CR10","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0304-3975(95)80029-9","volume":"143","author":"T. Jiang","year":"1995","unstructured":"Jiang, T., Wang, L., Zhang, K.: Alignment of trees \u2013 an alternative to tree edit. Theor. Comput. Sci., 143 (1): 137\u2013148 (1995)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"11_CR11","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1109\/TCBB.2008.59","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 Trans. Comput. Biol. Bioinformatics\u00a05(4), 503\u2013513 (2008)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinformatics"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"M\u00f6hl, M., Will, S., Backofen, R.: Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknots. In: Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching, pp. 69\u201381 (2008)","DOI":"10.1007\/978-3-540-69068-9_9"},{"issue":"17","key":"11_CR13","doi-asserted-by":"publisher","first-page":"3516","DOI":"10.1093\/bioinformatics\/bti577","volume":"21","author":"J. Reeder","year":"2005","unstructured":"Reeder, J., Giegerich, R.: Consensus Shapes: An Alternative to the Sankoff Algorithm for RNA Consensus Structure Prediction. Bioinformatics\u00a021(17), 3516\u20133523 (2005)","journal-title":"Bioinformatics"},{"issue":"4","key":"11_CR14","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1261\/rna.366507","volume":"13","author":"W. Ritchie","year":"2007","unstructured":"Ritchie, W., Legendre, M., Gautheret, D.: RNA stem loops: to be or not to be cleaved by RNAse III. RNA\u00a013(4), 457\u2013462 (2007)","journal-title":"RNA"},{"issue":"1","key":"11_CR15","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.tcs.2006.05.031","volume":"362","author":"F. Rossell\u00f3","year":"2006","unstructured":"Rossell\u00f3, F., Valiente, G.: An algebraic view of the relation between largest common subtrees and smallest common supertrees. Theor. Comput. Sci.\u00a0362(1), 33\u201353 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR16","unstructured":"Schirmer, S.: Comparing forests. PhD thesis, Faculty of Technology, Bielefeld University (to appear)"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/322139.322143","volume":"26","author":"K.C. Tai","year":"1979","unstructured":"Tai, K.C.: The tree-to-tree correction problem. J. ACM\u00a026, 422\u2013433 (1979)","journal-title":"J. ACM"},{"issue":"3","key":"11_CR18","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0020-0190(02)00369-1","volume":"85","author":"H. Touzet","year":"2003","unstructured":"Touzet, H.: Tree edit distance with gaps. Inf. Process. Lett.\u00a085(3), 123\u2013129 (2003)","journal-title":"Inf. Process. Lett."},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/11496656_29","volume-title":"Combinatorial Pattern Matching","author":"H. Touzet","year":"2005","unstructured":"Touzet, H.: A linear tree edit distance algorithm for similar ordered trees. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol.\u00a03537, pp. 334\u2013345. Springer, Heidelberg (2005)"},{"issue":"6","key":"11_CR20","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 Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21458-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T13:58:10Z","timestamp":1553867890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21458-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642214578","9783642214585"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21458-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}