{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T15:14:55Z","timestamp":1764688495007},"publisher-location":"Berlin\/Heidelberg","reference-count":14,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354056764X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029792","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T09:36:08Z","timestamp":1133429768000},"page":"1-10","source":"Crossref","is-referenced-by-count":21,"title":["A linear time pattern matching algorithm between a string and a tree"],"prefix":"10.1007","author":[{"given":"Tatsuya","family":"Akutsu","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"A. Amir, G. Benson, and M. Farach. \u201cAlphabet independent two dimensional pattern matching\u201d. In Proceedings of ACM Symposium on Theory of Computing, pp. 59\u201368, 1992.","DOI":"10.1145\/129712.129719"},{"key":"1_CR2","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF01762122","volume":"3","author":"A. Apostolico","year":"1988","unstructured":"A. Apostolico, C. Iliopoulos, G. M. Landau, B. Schieber, and U. Vishkin. \u201cParallel construction of a suffix tree with applications\u201d. Algorithmica, Vol. 3, pp. 347\u2013365, 1988.","journal-title":"Algorithmica"},{"key":"1_CR3","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"R. Boyer","year":"1977","unstructured":"R. Boyer and S. Moore. \u201cA fast string searching algorithm\u201d. Communications of the ACM, Vol. 20, pp. 762\u2013772, 1977.","journal-title":"Communications of the ACM"},{"key":"1_CR4","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/0196-6774(87)90030-7","volume":"8","author":"M. J. Chung","year":"1987","unstructured":"M. J. Chung. \u201cO(n 2.5) time algorithms for the subgraph homeomorphism on trees\u201d. Journal of Algorithms, Vol. 8, pp. 106\u2013112, 1987.","journal-title":"Journal of Algorithms"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"M. Dubiner, Z. Galil, and E Magen. \u201cFaster tree pattern matching\u201d. In Proceedings of IEEE Symposium on Foundations of Computer Science, pp. 145\u2013150, 1990.","DOI":"10.1109\/FSCS.1990.89533"},{"key":"1_CR6","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. \u201cComputers and Intractability: A Guide to the Theory of NP-completeness\u201d. Freeman, San Francisco, 1979."},{"key":"1_CR7","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D. E. Knuth","year":"1977","unstructured":"D. E. Knuth, J. Morris, and V. Pratt. \u201cFast pattern matching in strings\u201d. SIAM Journal on Computing, Vol. 6, pp. 323\u2013350, 1977.","journal-title":"SIAM Journal on Computing"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"S. R. Kosaraju. \u201cEfficient tree pattern matching\u201d. In Proceedings of IEEE Symposium on Foundations of Computer Science, pp. 178\u2013183, 1989.","DOI":"10.1109\/SFCS.1989.63475"},{"key":"1_CR9","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0196-6774(89)90010-2","volume":"10","author":"G. M. Landau","year":"1989","unstructured":"G. M. Landau and U. Vishkin. \u201cFast parallel and serial approximate string matching\u201d. Journal of Algorithms, Vol. 10, pp. 157\u2013169, 1989.","journal-title":"Journal of Algorithms"},{"key":"1_CR10","unstructured":"A. Lingas. \u201cSubgraph isomorphism for connected graphs of bounded valence and bounded separator is in NC\u201d. In Proceedings of the 1988 International Conference on Parallel Processing, pp. 304\u2013307, 1988."},{"key":"1_CR11","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E. M. McCreight","year":"1976","unstructured":"E. M. McCreight. \u201cA space-efficient suffix tree construction algorithm\u201d. Journal of the ACM, Vol. 23, pp. 262\u2013272, 1976.","journal-title":"Journal of the ACM"},{"key":"1_CR12","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1137\/0206053","volume":"6","author":"S. W. Reyner","year":"1977","unstructured":"S. W. Reyner. \u201cAn analysis of a good algorithm for the subtree problems\u201d. SIAM Journal on Computing, Vol. 6, pp. 730\u2013732, 1977.","journal-title":"SIAM Journal on Computing"},{"key":"1_CR13","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1021\/ci00047a025","volume":"25","author":"R. E. Stobaugh","year":"1985","unstructured":"R. E. Stobaugh. \u201cChemical substructure searching\u201d. Journal of Chemical Information and Computer Sciences, Vol. 25, pp. 271\u2013275, 1985.","journal-title":"Journal of Chemical Information and Computer Sciences"},{"key":"1_CR14","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1021\/c160016a007","volume":"5","author":"E. H. Sussenguth","year":"1965","unstructured":"E. H. Sussenguth. \u201cA graph-theoretic algorithm for matching chemical structures\u201d. Journal of Chemical Documentation, Vol. 5, pp. 36\u201343, 1965.","journal-title":"Journal of Chemical Documentation"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0029792","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,20]],"date-time":"2021-07-20T20:36:18Z","timestamp":1626813378000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029792"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354056764X"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0029792","relation":{},"subject":[]}}