{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T03:02:11Z","timestamp":1725591731265},"reference-count":17,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2016,12,1]],"date-time":"2016-12-01T00:00:00Z","timestamp":1480550400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,12,20]],"date-time":"2020-12-20T00:00:00Z","timestamp":1608422400000},"content-version":"vor","delay-in-days":1480,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1016\/j.tcs.2016.03.005","type":"journal-article","created":{"date-parts":[[2016,3,9]],"date-time":"2016-03-09T17:30:26Z","timestamp":1457544626000},"page":"215-224","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"special_numbering":"PB","title":["Faster Lyndon factorization algorithms for SLP and LZ78 compressed text"],"prefix":"10.1016","volume":"656","author":[{"given":"Tomohiro","family":"I","sequence":"first","affiliation":[]},{"given":"Yuto","family":"Nakashima","sequence":"additional","affiliation":[]},{"given":"Shunsuke","family":"Inenaga","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-6856-5185","authenticated-orcid":false,"given":"Hideo","family":"Bannai","sequence":"additional","affiliation":[]},{"given":"Masayuki","family":"Takeda","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.tcs.2016.03.005_br0010","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BF01191471","article-title":"Fast parallel Lyndon factorization with applications","volume":"28","author":"Apostolico","year":"1995","journal-title":"Math. Syst. Theory"},{"key":"10.1016\/j.tcs.2016.03.005_br0020","series-title":"CPM","first-page":"38","article-title":"Converting SLP to LZ78 in almost linear time","author":"Bannai","year":"2013"},{"issue":"1","key":"10.1016\/j.tcs.2016.03.005_br0030","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/j.tcs.2003.05.002","article-title":"The level ancestor problem simplified","volume":"321","author":"Bender","year":"2004","journal-title":"Theoret. Comput. Sci."},{"issue":"10","key":"10.1016\/j.tcs.2016.03.005_br0040","doi-asserted-by":"crossref","first-page":"2239","DOI":"10.1016\/j.patcog.2008.11.010","article-title":"Lyndon + Christoffel = digitally convex","volume":"42","author":"Brlek","year":"2009","journal-title":"Pattern Recognit."},{"issue":"1","key":"10.1016\/j.tcs.2016.03.005_br0050","doi-asserted-by":"crossref","first-page":"81","DOI":"10.2307\/1970044","article-title":"Free differential calculus. IV. The quotient groups of the lower central series","volume":"68","author":"Chen","year":"1958","journal-title":"Ann. of Math."},{"issue":"1","key":"10.1016\/j.tcs.2016.03.005_br0060","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0304-3975(94)90100-7","article-title":"Parallel RAM algorithms for factorizing words","volume":"127","author":"Daykin","year":"1994","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/j.tcs.2016.03.005_br0070","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0196-6774(83)90017-2","article-title":"Factorizing words over an ordered alphabet","volume":"4","author":"Duval","year":"1983","journal-title":"J. Algorithms"},{"key":"10.1016\/j.tcs.2016.03.005_br0080","series-title":"Data Compression Conference","first-page":"316","article-title":"Almost optimal fully LZW-compressed pattern matching","author":"Gasieniec","year":"1999"},{"key":"10.1016\/j.tcs.2016.03.005_br0090","series-title":"STACS","first-page":"624","article-title":"Tying up the loose ends in fully LZW-compressed pattern matching","author":"Gawrychowski","year":"2012"},{"key":"10.1016\/j.tcs.2016.03.005_br0100","author":"Gil"},{"key":"10.1016\/j.tcs.2016.03.005_br0110","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.ic.2014.09.009","article-title":"Detecting regularities on grammar-compressed strings","volume":"240","author":"I","year":"2015","journal-title":"Inform. and Comput."},{"key":"10.1016\/j.tcs.2016.03.005_br0120","series-title":"Proc. CPM 2013","first-page":"153","article-title":"Efficient Lyndon factorization of grammar compressed text","author":"I","year":"2013"},{"key":"10.1016\/j.tcs.2016.03.005_br0130","series-title":"String Processing and Information Retrieval \u2013 20th International Symposium, Proceedings","first-page":"174","article-title":"Faster Lyndon factorization algorithms for SLP and LZ78 compressed text","author":"I","year":"2013"},{"key":"10.1016\/j.tcs.2016.03.005_br0140","series-title":"Proc. PSC 2009","first-page":"65","article-title":"On bijective variants of the Burrows\u2013Wheeler transform","author":"Kufleitner","year":"2009"},{"key":"10.1016\/j.tcs.2016.03.005_br0150","author":"Nishimoto"},{"issue":"5","key":"10.1016\/j.tcs.2016.03.005_br0160","first-page":"1061","article-title":"Constructing the suffix tree of a tree with a large alphabet","volume":"E86-A","author":"Shibuya","year":"2003","journal-title":"IEICE Trans. Fund. Electron. Commun. Comput. Sci."},{"issue":"5","key":"10.1016\/j.tcs.2016.03.005_br0170","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","article-title":"Compression of individual sequences via variable-length coding","volume":"24","author":"Ziv","year":"1978","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439751600195X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439751600195X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,12,20]],"date-time":"2020-12-20T03:04:33Z","timestamp":1608433473000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439751600195X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12]]},"references-count":17,"alternative-id":["S030439751600195X"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2016.03.005","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2016,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Faster Lyndon factorization algorithms for SLP and LZ78 compressed text","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2016.03.005","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2016 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}