{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T03:47:34Z","timestamp":1648698454964},"reference-count":13,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":6758,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Syst. Comp. Jpn."],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1002\/(sici)1520-684x(199703)28:3<43::aid-scj5>3.0.co;2-q","type":"journal-article","created":{"date-parts":[[2002,8,25]],"date-time":"2002-08-25T19:28:04Z","timestamp":1030303684000},"page":"43-51","source":"Crossref","is-referenced-by-count":0,"title":["An efficient method for storing and retrieving graph structures"],"prefix":"10.1002","volume":"28","author":[{"given":"Hirokazu","family":"Iriguchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuhiko","family":"Tsuda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masami","family":"Shishibori","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun-ichi","family":"Aoe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"issue":"6","key":"10.1002\/(SICI)1520-684X(199703)28:3<43::AID-SCJ5>3.0.CO;2-Q-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":"Commun. ACM"},{"key":"10.1002\/(SICI)1520-684X(199703)28:3<43::AID-SCJ5>3.0.CO;2-Q-BIB2","volume-title":"Data Structures and Algorithms","author":"Aho","year":"1983"},{"key":"10.1002\/(SICI)1520-684X(199703)28:3<43::AID-SCJ5>3.0.CO;2-Q-BIB3","volume-title":"Compilers: Principles, Techniques, and Tools","author":"Aho","year":"1986"},{"issue":"8","key":"10.1002\/(SICI)1520-684X(199703)28:3<43::AID-SCJ5>3.0.CO;2-Q-BIB4","doi-asserted-by":"crossref","first-page":"1010","DOI":"10.1109\/32.31357","article-title":"An efficient implementation of static string pattern matching machines","volume":"SE-15","author":"Aoe","year":"1989","journal-title":"IEEE Trans. Softw. Eng."},{"key":"10.1002\/(SICI)1520-684X(199703)28:3<43::AID-SCJ5>3.0.CO;2-Q-BIB5","volume-title":"Computer Algorithms: Key Search Strategies","author":"Aoe","year":"1991"},{"issue":"5","key":"10.1002\/(SICI)1520-684X(199703)28:3<43::AID-SCJ5>3.0.CO;2-Q-BIB6","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1145\/42411.42420","article-title":"The world's fastest scrabble program","volume":"31","author":"Apple","year":"1988","journal-title":"Commun. ACM"},{"key":"10.1002\/(SICI)1520-684X(199703)28:3<43::AID-SCJ5>3.0.CO;2-Q-BIB7","unstructured":"K. Kita. A Study on Language Modeling For Speech Recognition, Ph.D. thesis, Waseda University (1992)."},{"key":"10.1002\/(SICI)1520-684X(199703)28:3<43::AID-SCJ5>3.0.CO;2-Q-BIB8","volume-title":"Sorting and Searching","volume":"3","author":"Knuth","year":"1973"},{"issue":"7","key":"10.1002\/(SICI)1520-684X(199703)28:3<43::AID-SCJ5>3.0.CO;2-Q-BIB9","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1145\/360248.360258","article-title":"Compressed tries","volume":"19","author":"Kurt","year":"1976","journal-title":"Commun. ACM"},{"issue":"11","key":"10.1002\/(SICI)1520-684X(199703)28:3<43::AID-SCJ5>3.0.CO;2-Q-BIB10","first-page":"2374","article-title":"A retrieval algorithm of dictionaries by using two tier structures","volume":"J76","author":"Morimoto","year":"1993","journal-title":"IEICE (DII)"},{"key":"10.1002\/(SICI)1520-684X(199703)28:3<43::AID-SCJ5>3.0.CO;2-Q-BIB11","doi-asserted-by":"crossref","first-page":"440","DOI":"10.3115\/992133.992138","article-title":"Quasi-destructive graph unification with structure-sharing","volume":"2","author":"Tomabechi","year":"1992","journal-title":"Proc. of the 14th International Conference on Computational Linguistics"},{"issue":"11","key":"10.1002\/(SICI)1520-684X(199703)28:3<43::AID-SCJ5>3.0.CO;2-Q-BIB12","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1145\/359168.359175","article-title":"Storing a sparse table","volume":"22","author":"Tarjan","year":"1979","journal-title":"Commun. ACM"},{"key":"10.1002\/(SICI)1520-684X(199703)28:3<43::AID-SCJ5>3.0.CO;2-Q-BIB13","volume-title":"Data Structure Techniques","author":"Thomas","year":"1980"}],"container-title":["Systems and Computers in Japan"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2F(SICI)1520-684X(199703)28:3%3C43::AID-SCJ5%3E3.0.CO;2-Q","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/(SICI)1520-684X(199703)28:3%3C43::AID-SCJ5%3E3.0.CO;2-Q","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T08:20:19Z","timestamp":1625127619000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/(SICI)1520-684X(199703)28:3<43::AID-SCJ5>3.0.CO;2-Q"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,3]]}},"URL":"https:\/\/doi.org\/10.1002\/(sici)1520-684x(199703)28:3<43::aid-scj5>3.0.co;2-q","relation":{},"ISSN":["0882-1666","1520-684X"],"issn-type":[{"value":"0882-1666","type":"print"},{"value":"1520-684X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}