{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T11:47:04Z","timestamp":1749124024951},"reference-count":19,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,2,1]],"date-time":"1993-02-01T00:00:00Z","timestamp":728524800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7471,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1993,2]]},"DOI":"10.1016\/0304-3975(93)90198-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"345-356","source":"Crossref","is-referenced-by-count":18,"title":["On finding common subtrees"],"prefix":"10.1016","volume":"108","author":[{"given":"Roberto","family":"Grossi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90198-3_BIB1","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/360825.360855","article-title":"Efficient string matching: an aid to bibliographic search","volume":"18","author":"Aho","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(93)90198-3_BIB2","first-page":"84","article-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0304-3975(93)90198-3_BIB3","series-title":"Compilers: Principles, Techniques and Tools","author":"Aho","year":"1986"},{"key":"10.1016\/0304-3975(93)90198-3_BIB4","series-title":"Combinatorial algorithms on words","first-page":"85","article-title":"The myriad virtues of subword trees","author":"Apostolico","year":"1985"},{"key":"10.1016\/0304-3975(93)90198-3_BIB5","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1109\/FSCS.1990.89530","article-title":"Approximate string matching in sublinear expected time","author":"Chang","year":"1990","journal-title":"Proc. 31st IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(93)90198-3_BIB6","series-title":"Combinatorial algorithms on words","first-page":"97","article-title":"Efficient and elegant subword tree construction","author":"Chen","year":"1985"},{"key":"10.1016\/0304-3975(93)90198-3_BIB7","first-page":"26","article-title":"Longest common factor of two words","volume":"Vol. 249","author":"Crochemore","year":"1987"},{"key":"10.1016\/0304-3975(93)90198-3_BIB8","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1145\/322217.322228","article-title":"Variations on the common subexpression problem","volume":"27","author":"Downey","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(93)90198-3_BIB9","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1109\/FSCS.1990.89533","article-title":"Faster tree pattern matching","author":"Dubiner","year":"1990","journal-title":"Proc. 31st IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(93)90198-3_BIB10","first-page":"220","article-title":"Analytic variations on the common subexpression problem","volume":"Vol. 443","author":"Flajolet","year":"1990"},{"key":"10.1016\/0304-3975(93)90198-3_BIB11","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/322290.322295","article-title":"Pattern matching in trees","volume":"29","author":"Hoffmann","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(93)90198-3_BIB12","first-page":"125","article-title":"Rapid identification of repeated patterns in strings, trees and arrays","author":"Karp","year":"1972","journal-title":"Proc. 4th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(93)90198-3_BIB13_1","series-title":"The Art of Computer Programming, Vol. 1: Fundamental Algorithms","author":"Knuth","year":"1968"},{"key":"10.1016\/0304-3975(93)90198-3_BIB13_2","series-title":"The Art of Computer Programming, Vol. 1: Fundamental Algorithms","author":"Knuth","year":"1973"},{"key":"10.1016\/0304-3975(93)90198-3_BIB14","first-page":"178","article-title":"Efficient tree pattern matching","author":"Kosaraju","year":"1989","journal-title":"Proc. 30th IEEE Symp. of Foundations of Computer Science (FOCS)"},{"key":"10.1016\/0304-3975(93)90198-3_BIB15","first-page":"193","article-title":"Simple solutions for approximate tree matching problems","volume":"Vol. 493","author":"Luccio","year":"1991"},{"key":"10.1016\/0304-3975(93)90198-3_BIB16","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0020-0190(89)90056-2","article-title":"On the subtree isomorphism problem for ordered trees","volume":"32","author":"M\u00e4kinen","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(93)90198-3_BIB17","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","article-title":"A space-economical suffix tree construction algorithm","volume":"23","author":"McCreight","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(93)90198-3_BIB18","first-page":"1","article-title":"Linear pattern matching algorithm","author":"Weiner","year":"1973","journal-title":"Proc. 41th IEEE SWAT (FOCS)"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397593901983?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397593901983?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T06:20:13Z","timestamp":1580883613000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397593901983"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,2]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,2]]}},"alternative-id":["0304397593901983"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90198-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,2]]}}}