{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T23:09:34Z","timestamp":1725750574217},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319024318"},{"type":"electronic","value":"9783319024325"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-02432-5_21","type":"book-chapter","created":{"date-parts":[[2013,9,29]],"date-time":"2013-09-29T20:51:58Z","timestamp":1380487918000},"page":"174-185","source":"Crossref","is-referenced-by-count":4,"title":["Faster Lyndon Factorization Algorithms for SLP and LZ78 Compressed Text"],"prefix":"10.1007","author":[{"given":"Tomohiro","family":"I","sequence":"first","affiliation":[]},{"given":"Yuto","family":"Nakashima","sequence":"additional","affiliation":[]},{"given":"Shunsuke","family":"Inenaga","sequence":"additional","affiliation":[]},{"given":"Hideo","family":"Bannai","sequence":"additional","affiliation":[]},{"given":"Masayuki","family":"Takeda","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"21_CR1","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BF01191471","volume":"28","author":"A. Apostolico","year":"1995","unstructured":"Apostolico, A., Crochemore, M.: Fast parallel Lyndon factorization with applications. Mathematical Systems Theory\u00a028(2), 89\u2013108 (1995)","journal-title":"Mathematical Systems Theory"},{"issue":"1","key":"21_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.tcs.2003.05.002","volume":"321","author":"M.A. Bender","year":"2004","unstructured":"Bender, M.A., Farach-Colton, M.: The level ancestor problem simplified. Theor. Comput. Sci.\u00a0321(1), 5\u201312 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"10","key":"21_CR3","doi-asserted-by":"publisher","first-page":"2239","DOI":"10.1016\/j.patcog.2008.11.010","volume":"42","author":"S. Brlek","year":"2009","unstructured":"Brlek, S., Lachaud, J.O., Proven\u00e7al, X., Reutenauer, C.: Lyndon + Christoffel = digitally convex. Pattern Recognition\u00a042(10), 2239\u20132246 (2009)","journal-title":"Pattern Recognition"},{"issue":"1","key":"21_CR4","doi-asserted-by":"publisher","first-page":"81","DOI":"10.2307\/1970044","volume":"68","author":"K.T. Chen","year":"1958","unstructured":"Chen, K.T., Fox, R.H., Lyndon, R.C.: Free differential calculus. iv. the quotient groups of the lower central series. Annals of Mathematics\u00a068(1), 81\u201395 (1958)","journal-title":"Annals of Mathematics"},{"issue":"1","key":"21_CR5","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0304-3975(94)90100-7","volume":"127","author":"J.W. Daykin","year":"1994","unstructured":"Daykin, J.W., Iliopoulos, C.S., Smyth, W.F.: Parallel RAM algorithms for factorizing words. Theor. Comput. Sci.\u00a0127(1), 53\u201367 (1994)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"21_CR6","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/0196-6774(83)90017-2","volume":"4","author":"J.P. Duval","year":"1983","unstructured":"Duval, J.P.: Factorizing words over an ordered alphabet. J. Algorithms\u00a04(4), 363\u2013381 (1983)","journal-title":"J. Algorithms"},{"key":"21_CR7","unstructured":"Gil, J.Y., Scott, D.A.: A bijective string sorting transform. CoRR abs\/1201.3077 (2012)"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/978-3-642-40313-2_51","volume-title":"Mathematical Foundations of Computer Science 2013","author":"T. I","year":"2013","unstructured":"I, T., Matsubara, W., Shimohira, K., Inenaga, S., Bannai, H., Takeda, M., Narisawa, K., Shinohara, A.: Detecting regularities on grammar-compressed strings. In: Chatterjee, K., Sgall, J. (eds.) MFCS 2013. LNCS, vol.\u00a08087, pp. 571\u2013582. Springer, Heidelberg (2013)"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-642-38905-4_16","volume-title":"Combinatorial Pattern Matching","author":"T. I","year":"2013","unstructured":"I, T., Nakashima, Y., Inenaga, S., Bannai, H., Takeda, M.: Efficient lyndon factorization of grammar compressed text. In: Fischer, J., Sanders, P. (eds.) CPM 2013. LNCS, vol.\u00a07922, pp. 153\u2013164. Springer, Heidelberg (2013)"},{"key":"21_CR10","unstructured":"Kufleitner, M.: On bijective variants of the Burrows-Wheeler transform. In: Proc. PSC 2009, pp. 65\u201379 (2009)"},{"issue":"5","key":"21_CR11","first-page":"1061","volume":"E86-A","author":"T. Shibuya","year":"2003","unstructured":"Shibuya, T.: Constructing the suffix tree of a tree with a large alphabet. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences\u00a0E86-A(5), 1061\u20131066 (2003)","journal-title":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"},{"issue":"5","key":"21_CR12","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","volume":"24","author":"J. Ziv","year":"1978","unstructured":"Ziv, J., Lempel, A.: Compression of individual sequences via variable-length coding. IEEE Transactions on Information Theory\u00a024(5), 530\u2013536 (1978)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-02432-5_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T12:46:27Z","timestamp":1558097187000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-02432-5_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319024318","9783319024325"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-02432-5_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}