{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:08:44Z","timestamp":1742378924910},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540580942"},{"type":"electronic","value":"9783540484509"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58094-8_7","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:12:41Z","timestamp":1330269161000},"page":"75-86","source":"Crossref","is-referenced-by-count":61,"title":["Alignment of trees \u2014 An alternative to tree edit"],"prefix":"10.1007","author":[{"given":"Tao","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaizhong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"7_CR1","unstructured":"M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, 1979."},{"key":"7_CR2","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF02460299","volume":"55","author":"D. Gusfield","year":"1993","unstructured":"D. Gusfield, Efficient methods for multiple sequence alignment with guaranteed error bounds, Bulletin of Mathematical Biology 55, pp. 141\u2013154, 1993.","journal-title":"Bulletin of Mathematical Biology"},{"key":"7_CR3","unstructured":"P. Kilpelainen and H. Mannila, Ordered and unordered tree inclusion, Report A-1991-4, Dept. of Comp. Science, University of Helsinki, August. 1991; to appear in SIAM J. on Computing."},{"key":"7_CR4","first-page":"205","volume":"5","author":"S.-Y. Le","year":"1989","unstructured":"S.-Y. Le, J. Owens, R. Nussinov, J.-H. Chen B. Shapiro and J. V. Maizel, RNA secondary structures: comparison and determination of frequently recurring substructures by consensus, Comp. Appl. Biosci. 5, 205\u2013210, 1989.","journal-title":"Comp. Appl. Biosci."},{"key":"7_CR5","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/0010-4809(89)90039-6","volume":"22","author":"S.-Y. Le","year":"1989","unstructured":"S.-Y. Le, R. Nussinov, and J.V. Maizel, Tree graphs of RNA secondary structures and their comparisons, Computers and Biomedical Research, 22, 461\u2013473, 1989.","journal-title":"Computers and Biomedical Research"},{"key":"7_CR6","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1109\/TPAMI.1979.6786615","volume":"1","author":"S.Y. Lu","year":"1979","unstructured":"S.Y. Lu, A tree-tree distance and its application to cluster analysis, IEEE Trans. Pattern Anal. Mach. Intelligence 1, 219\u2013224, 1979.","journal-title":"IEEE Trans. Pattern Anal. Mach. Intelligence"},{"key":"7_CR7","volume-title":"Time Warps, String Edits, and Macromolecules: the Theory and Practice of Sequence Comparison","author":"D. Sankoff","year":"1983","unstructured":"D. Sankoff and J. Kruskal (Eds), Time Warps, String Edits, and Macromolecules: the Theory and Practice of Sequence Comparison, Addison Wesley, Reading Mass., 1983."},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"B. Shapiro, An algorithm for comparing multiple RNA secondary structures, Comput. Appl. Biosci. 387\u2013393, 1988.","DOI":"10.1093\/bioinformatics\/4.3.387"},{"key":"7_CR9","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/BF02426925","volume":"1","author":"F.Y. Shih","year":"1991","unstructured":"F.Y. Shih, Object representation and recognition using mathematical morphology model, J. System Integration, vol. 1, pp.235\u2013256, 1991.","journal-title":"J. System Integration"},{"key":"7_CR10","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/34.23111","volume":"PAMI-11","author":"F.Y. Shih","year":"1989","unstructured":"F.Y. Shih and O.R. Mitchell, Threshold decomposition of grayscale morphology into binary morphology, IEEE Trans. Pattern Anal. Mach. Intell., vol. PAMI-11, pp.31\u201342, 1989.","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"no.4","key":"7_CR11","first-page":"309","volume":"6","author":"B. Shapiro","year":"1990","unstructured":"B. Shapiro and K. Zhang, Comparing multiple RNA secondary structures using tree comparisons, Comput. Appl. Biosci. vol. 6, no. 4, pp.309\u2013318, 1990.","journal-title":"Comput. Appl. Biosci."},{"key":"7_CR12","doi-asserted-by":"crossref","first-page":"23","DOI":"10.2116\/analsci.3.23","volume":"3","author":"Y. Takahashi","year":"1987","unstructured":"Y. Takahashi, Y. Satoh, H. Suzuki and S. Sasaki, Recognition of largest common structural fragment among a variety of chemical structures, Analytical Science, vol. 3, pp23\u201328, 1987.","journal-title":"Analytical Science"},{"key":"7_CR13","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/322139.322143","volume":"26","author":"K.C. Tai","year":"1979","unstructured":"K.C. Tai, The tree-to-tree correction problem, J. ACM, 26, 422\u2013433, 1979.","journal-title":"J. ACM"},{"key":"7_CR14","unstructured":"L. Wang and T. Jiang, On the complexity of multiple sequence alignment, 1993, to appear in Journal of Computational Biology."},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"K. Zhang and T. Jiang, Some MAX SNP-hard results concerning unordered labeled trees, 1993, To appear in Information Processing Letters.","DOI":"10.1016\/0020-0190(94)90062-0"},{"key":"7_CR16","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"K. Zhang","year":"1989","unstructured":"K. Zhang and D. Shasha, Simple fast algorithms for the editing distance between trees and related problems, SIAM J. Comput. 18, 1245\u20131262, 1989.","journal-title":"SIAM J. Comput."},{"key":"7_CR17","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0020-0190(92)90136-J","volume":"42","author":"K. Zhang","year":"1992","unstructured":"K. Zhang, R. Statman, and D. Shasha, On the editing distance between unordered labeled trees, Information Processing Letters, 42, 133\u2013139, 1992.","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58094-8_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:16:58Z","timestamp":1605647818000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58094-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540580942","9783540484509"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-58094-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}