{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:14:47Z","timestamp":1759637687156,"version":"3.37.3"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2015,12,1]],"date-time":"2015-12-01T00:00:00Z","timestamp":1448928000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100000646","name":"JSPS","doi-asserted-by":"publisher","award":["26240034","25730005","24650042"],"award-info":[{"award-number":["26240034","25730005","24650042"]}],"id":[{"id":"10.13039\/501100000646","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Collaborative Research Programs of National Institute of Informatics"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2015,12,1]]},"DOI":"10.1109\/tkde.2015.2457922","type":"journal-article","created":{"date-parts":[[2015,7,17]],"date-time":"2015-07-17T14:56:34Z","timestamp":1437144994000},"page":"3360-3373","source":"Crossref","is-referenced-by-count":1,"title":["Similar Subtree Search Using Extended Tree Inclusion"],"prefix":"10.1109","volume":"27","author":[{"given":"Tomoya","family":"Mori","sequence":"first","affiliation":[]},{"given":"Atsuhiro","family":"Takasu","sequence":"additional","affiliation":[]},{"given":"Jesper","family":"Jansson","sequence":"additional","affiliation":[]},{"given":"Jaewook","family":"Hwang","sequence":"additional","affiliation":[]},{"given":"Takeyuki","family":"Tamura","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9763-797X","authenticated-orcid":false,"given":"Tatsuya","family":"Akutsu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkt1076"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20414"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511790492"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(92)90687-B"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920904"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956759"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.125"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447905"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066243"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/21.286387"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1644015.1644017"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s007780100057"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90136-J"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2012.0133"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.12.030"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/BF01975866"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"461","DOI":"10.3233\/FI-2014-1054","article-title":"Segmental mapping and distance for rooted labeled ordered trees","volume":"132","author":"kan","year":"2014","journal-title":"Fundam Inf"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2004.08.017"},{"journal-title":"Inferring Phylogenies","year":"2004","author":"felsenstein","key":"ref4"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1978782.1978793"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkh473"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-011-0254-6"},{"article-title":"Partial tree-edit distance","year":"2014","author":"piernik","key":"ref29"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2006.13.1165"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.14778\/2095686.2095692"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1061318.1061326"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiomed.2007.06.005"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.01.014"},{"key":"ref9","first-page":"13","article-title":"Measuring tree similarity for natural language processing based information retrieval","author":"lin","year":"0","journal-title":"Proc Int Conf Appl Natural Language Process Inf Syst"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)90062-0"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791218202"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)80015-8"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.11.017"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/322139.322143"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31265-6_29"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.10.002"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/7317845\/07161364.pdf?arnumber=7161364","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:45:49Z","timestamp":1641987949000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7161364\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,1]]},"references-count":36,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2015.2457922","relation":{},"ISSN":["1041-4347"],"issn-type":[{"type":"print","value":"1041-4347"}],"subject":[],"published":{"date-parts":[[2015,12,1]]}}}