{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:28:25Z","timestamp":1725456505234},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648581"},{"type":"electronic","value":"9783540685265"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0033235","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T07:48:58Z","timestamp":1133423338000},"page":"169-180","source":"Crossref","is-referenced-by-count":1,"title":["The noisy subsequence tree recognition problem"],"prefix":"10.1007","author":[{"given":"B. J.","family":"Oommen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. K. S.","family":"Loke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"issue":"2","key":"13_CR1","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1109\/TPAMI.1979.6786615","volume":"PAMI 1","author":"S. Y. Lu","year":"1979","unstructured":"S. Y. Lu, \u201cA tree-to-tree distance and its application to cluster analysis\u201d, IEEE Trans. Pattern Anal. and Mach. Intell., Vol. PAMI 1, No. 2: pp. 219\u2013224 (1979).","journal-title":"IEEE Trans. Pattern Anal. and Mach. Intell."},{"issue":"5","key":"13_CR2","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1109\/TPAMI.1987.4767962","volume":"PAMI 9","author":"B. J. Oommen","year":"1987","unstructured":"B. J. Oommen, \u201cRecognition of noisy subsequences using constrained edit distances\u201d, IEEE Trans. Pattern Anal. and Mach. Intell., Vol. PAMI 9, No. 5: pp. 676\u2013685 (1987).","journal-title":"IEEE Trans. Pattern Anal. and Mach. Intell."},{"key":"13_CR3","unstructured":"B. J. Oommen and R. L. Kashyap, \u201cA formal theory for optimal and information theoretic syntactic pattern recognition\u201d. (To appear in Pattern Recognition)."},{"issue":"34","key":"13_CR4","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0020-0255(94)90004-3","volume":"77","author":"B. J. Oommen","year":"1994","unstructured":"B. J. Oommen, and W. Lee, \u201cConstrained Tree Editing\u201d, Information Sciences, Vol. 77 No. 3,4: pp. 253\u2013273 (1994).","journal-title":"Information Sciences"},{"issue":"34","key":"13_CR5","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0020-0255(94)90004-3","volume":"77","author":"B. J. Oommen","year":"1994","unstructured":"B. J. Oommen, and W. Lee, \u201cConstrained Tree Editing\u201d, Information Sciences, Vol. 77 No. 3,4: pp. 253\u2013273 (1994).","journal-title":"Information Sciences"},{"key":"13_CR6","unstructured":"B. J. Oommen and R. K. S Loke, \u201cOn the Recognition of Noisy Subsequence Trees\u201d. Unabridged version of this paper."},{"key":"13_CR7","unstructured":"D. Sankoff and J. B. Kruskal, Time wraps, string edits, and macromolecules: Theory and practice of sequence comparison, Addison-Wesley, (1983)."},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/0020-0190(77)90064-3","volume":"6","author":"S. M. Selkow","year":"1977","unstructured":"S. M. Selkow, \u201cThe tree-to-tree editing problem\u201d, Inform. Proc. Let., Vol. 6, pp. 184\u2013186 (1977).","journal-title":"Inform. Proc. Let."},{"issue":"4","key":"13_CR9","first-page":"309","volume":"6","author":"B. Shapiro","year":"1990","unstructured":"B. Shapiro and K. Zhang, \u201cComparing multiple RNA secondary structures using tree comparisons\u201d, Comput. Appl. Biosci. vol. 6, no. 4, 309\u2013318 (1990).","journal-title":"Comput. Appl. Biosci."},{"key":"13_CR10","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/322139.322143","volume":"26","author":"K. C. Tai","year":"1979","unstructured":"K. C. Tai, \u201cThe tree-to-tree correction problem\u201d, J. Assoc. Comput. Mach., Vol. 26: pp. 422\u2013433 (1979).","journal-title":"J. Assoc. Comput. Mach."},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0020-0190(94)90062-0","volume":"49","author":"K. Zhang","year":"1994","unstructured":"K. Zhang and T. Jiang, \u201cSome MAX SNP-hard results concerning unordered labeled trees\u201d, Information Processing Letters, 49, 249\u2013254 (1994).","journal-title":"Information Processing Letters"},{"issue":"6","key":"13_CR12","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"K. Zhang","year":"1989","unstructured":"K. Zhang and D. Shasha, \u201cSimple fast algorithms for the editing distance between trees and related problems\u201d, SIAM J. Comput. Vol. 18, No. 6: pp. 1245\u20131262 (1989).","journal-title":"SIAM J. Comput."},{"key":"13_CR13","unstructured":"K. Zhang, D. Shasha and J. T. L. Wang, \u201cFast serial and parallel approximate tree matching with VLDC's\u201d, tProc. of the 1992 Symposium on Combinatorial Pattern Matching, CPM92, 148\u2013161 (1992)."}],"container-title":["Lecture Notes in Computer Science","Advances in Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0033235","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,6]],"date-time":"2019-02-06T05:31:15Z","timestamp":1549431075000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0033235"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648581","9783540685265"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0033235","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}