{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:36:11Z","timestamp":1725489371795},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734369"},{"type":"electronic","value":"9783540734376"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73437-6_21","type":"book-chapter","created":{"date-parts":[[2007,8,13]],"date-time":"2007-08-13T17:36:44Z","timestamp":1187026604000},"page":"195-204","source":"Crossref","is-referenced-by-count":1,"title":["Guided Forest Edit Distance: Better Structure Comparisons by Using Domain-knowledge"],"prefix":"10.1007","author":[{"given":"Zeshan","family":"Peng","sequence":"first","affiliation":[]},{"given":"Hing-fung","family":"Ting","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"21_CR1","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.ipl.2004.02.008","volume":"90","author":"F.Y.L. Chin","year":"2004","unstructured":"Chin, F.Y.L., Santis, A.D., Ferrara, A.L., Ho, N.L., Kim, S.K.: A simple algorithm for the constrained sequence problems. Information Processing Letters\u00a090(4), 175\u2013179 (2004)","journal-title":"Information Processing Letters"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Cobena, G., Abiteboul, S., Marian, A.: Detecting changes in XML documents. In: Proc. of the 18th IEEE International Conference on Data Engineering, pp. 41\u201352 (2002)","DOI":"10.1109\/ICDE.2002.994696"},{"issue":"2","key":"21_CR3","first-page":"371","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 Molecular Biology\u00a09(2), 371\u2013388 (2002)","journal-title":"Journal of Molecular Biology"},{"issue":"2","key":"21_CR4","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1137\/S0097539791218202","volume":"24","author":"P. Kilpelainen","year":"1995","unstructured":"Kilpelainen, P., Mannila, H.: Ordered and unordered tree inclusion. SIAM Journal on Computing\u00a024(2), 340\u2013356 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Klein, P.N.: Computing the edit-distance between unrooted ordered trees. In: Proc. of the 6th European Symposium on Algorithms (ESA\u00a01998), pp. 91\u2013102 (1998)","DOI":"10.1007\/3-540-68530-8_8"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Lin, G.H., Ma, B., Zhang, K.: Edit distance between two RNA structures. In: Proc. of the 5th international conference on Computational molecular biology, pp. 211\u2013220 (2001)","DOI":"10.1145\/369133.369214"},{"issue":"1","key":"21_CR7","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1093\/bioinformatics\/bth468","volume":"21","author":"C.L. Lu","year":"2004","unstructured":"Lu, C.L., Huang, Y.P.: A memory-efficient algorithm for multiple sequence alignment with constraints. Bioinformatics\u00a021(1), 20\u201330 (2004)","journal-title":"Bioinformatics"},{"key":"21_CR8","unstructured":"Nierman, A., Jagadish, H.V.: Evaluating structural similarity in XML documents. In: Proc. of the 5th International Workshop on the Web and Databases, pp. 61\u201366 (2002)"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Peng, Z.S., Ting, H.F.: Time and space efficient algorithms for constrained sequence alignment. In: Proc. of the 9th International Conference on Implementation and Application of Automata, pp. 237\u2013246 (2004)","DOI":"10.1007\/978-3-540-30500-2_22"},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1093\/bioinformatics\/6.4.309","volume":"6","author":"B.A. Shapiro","year":"1990","unstructured":"Shapiro, B.A., Zhang, K.: Comparing multiple RNA secondary structures using tree comparisons. Bioinformatics\u00a06, 309\u2013318 (1990)","journal-title":"Bioinformatics"},{"issue":"3","key":"21_CR11","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. Journal of the ACM\u00a026(3), 422\u2013433 (1979)","journal-title":"Journal of the ACM"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Tsai, Y.T.: The constrained longest common subsequence problem. Information Processing Letters, 88(4) (2003)","DOI":"10.1016\/j.ipl.2003.07.001"},{"issue":"6","key":"21_CR13","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 on Computing\u00a018(6), 1245\u20131262 (1989)","journal-title":"SIAM Journal on Computing"},{"key":"21_CR14","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1007\/BF02459506","volume":"46","author":"M. Zuker","year":"1984","unstructured":"Zuker, M., Sankoff, D.: RNA secondary structures and their prediction. Bull. Math. Biol.\u00a046, 591\u2013621 (1984)","journal-title":"Bull. Math. Biol."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73437-6_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:12:07Z","timestamp":1619518327000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73437-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734369","9783540734376"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73437-6_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}