{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T21:53:10Z","timestamp":1673560390588},"reference-count":11,"publisher":"Elsevier BV","issue":"5-6","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":3578,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Discrete Algorithms"],"published-print":{"date-parts":[[2003,10]]},"DOI":"10.1016\/s1570-8667(03)00034-0","type":"journal-article","created":{"date-parts":[[2003,11,27]],"date-time":"2003-11-27T12:12:55Z","timestamp":1069935175000},"page":"387-408","source":"Crossref","is-referenced-by-count":11,"title":["The suffix binary search tree and suffix AVL tree"],"prefix":"10.1016","volume":"1","author":[{"given":"Robert W.","family":"Irving","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lorna","family":"Love","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1570-8667(03)00034-0_BIB001","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1007\/PL00009260","article-title":"Suffix trees on words","volume":"23","author":"Andersson","year":"1999","journal-title":"Algorithmica"},{"key":"10.1016\/S1570-8667(03)00034-0_BIB002","series-title":"Combinatorial Algorithms on Words","first-page":"85","article-title":"The myriad virtues of subword trees","volume":"F12","author":"Apostolico","year":"1985"},{"issue":"6","key":"10.1016\/S1570-8667(03)00034-0_BIB003","doi-asserted-by":"crossref","first-page":"987","DOI":"10.1145\/355541.355547","article-title":"On the sorting complexity of suffix tree construction","volume":"47","author":"Farach","year":"2000","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S1570-8667(03)00034-0_BIB004","series-title":"Computer Science and Computational Biology","article-title":"Algorithms on Strings, Trees, and Sequences","author":"Gusfield","year":"1997"},{"key":"10.1016\/S1570-8667(03)00034-0_BIB005","unstructured":"R.W. Irving, L. Love, The suffix binary search tree and suffix AVL tree, Technical Report, Computing Science Department, University of Glasgow, Technical Report TR-2000-54, 2000"},{"key":"10.1016\/S1570-8667(03)00034-0_BIB006","doi-asserted-by":"crossref","first-page":"1149","DOI":"10.1002\/(SICI)1097-024X(199911)29:13<1149::AID-SPE274>3.0.CO;2-O","article-title":"Reducing the space requirement of suffix trees","volume":"29","author":"Kurtz","year":"1999","journal-title":"Software Practice Experience"},{"issue":"5","key":"10.1016\/S1570-8667(03)00034-0_BIB007","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0222058","article-title":"Suffix arrays: A new method for on-line string searches","volume":"22","author":"Manber","year":"1993","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/S1570-8667(03)00034-0_BIB008","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. Assoc. Comput. Mach."},{"issue":"3","key":"10.1016\/S1570-8667(03)00034-0_BIB009","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF01206331","article-title":"On-line construction of suffix trees","volume":"14","author":"Ukkonen","year":"1995","journal-title":"Algorithmica"},{"key":"10.1016\/S1570-8667(03)00034-0_BIB010","first-page":"263","article-title":"An algorithm for the organisation of information","volume":"146","author":"Adel'son Velskii","year":"1962","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10.1016\/S1570-8667(03)00034-0_BIB011","series-title":"Proceedings of the IEEE 14th Annual Symposium on Switching and Automata Theory","first-page":"1","article-title":"Linear pattern matching algorithms","author":"Weiner","year":"1973"}],"container-title":["Journal of Discrete Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1570866703000340?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1570866703000340?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T17:58:09Z","timestamp":1550339889000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1570866703000340"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":11,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2003,10]]}},"alternative-id":["S1570866703000340"],"URL":"https:\/\/doi.org\/10.1016\/s1570-8667(03)00034-0","relation":{},"ISSN":["1570-8667"],"issn-type":[{"value":"1570-8667","type":"print"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}