{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:36:17Z","timestamp":1725730577430},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387708"},{"type":"electronic","value":"9783642387715"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38771-5_13","type":"book-chapter","created":{"date-parts":[[2013,6,9]],"date-time":"2013-06-09T22:16:25Z","timestamp":1370816185000},"page":"131-142","source":"Crossref","is-referenced-by-count":3,"title":["Suffixes, Conjugates and Lyndon Words"],"prefix":"10.1007","author":[{"given":"Silvia","family":"Bonomo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sabrina","family":"Mantaci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Restivo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanna","family":"Rosone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marinella","family":"Sciortino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Adjeroh, D., Bell, T., Mukherjee, A.: The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching, 1st edn. Springer Publishing Company, Incorporated (2008)","DOI":"10.1007\/978-0-387-78909-5"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-642-21458-5_20","volume-title":"Combinatorial Pattern Matching","author":"M.J. Bauer","year":"2011","unstructured":"Bauer, M.J., Cox, A.J., Rosone, G.: Lightweight BWT construction for very large string collections. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol.\u00a06661, pp. 219\u2013231. Springer, Heidelberg (2011)"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.tcs.2012.02.002","volume":"483","author":"M.J. Bauer","year":"2013","unstructured":"Bauer, M.J., Cox, A.J., Rosone, G.: Lightweight algorithms for constructing and inverting the BWT of string collections. Theoret. Comput. Sci.\u00a0483, 134\u2013148 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-642-33122-0_26","volume-title":"Algorithms in Bioinformatics","author":"M.J. Bauer","year":"2012","unstructured":"Bauer, M.J., Cox, A.J., Rosone, G., Sciortino, M.: Lightweight LCP construction for next-generation sequencing datasets. In: Raphael, B., Tang, J. (eds.) WABI 2012. LNCS, vol.\u00a07534, pp. 326\u2013337. Springer, Heidelberg (2012)"},{"key":"13_CR5","unstructured":"Burrows, M., Wheeler, D.J.: A block sorting data compression algorithm. Technical report, DIGITAL System Research Center (1994)"},{"issue":"2","key":"13_CR6","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. Ann. of Math.\u00a068(2), 81\u201395 (1958)","journal-title":"Ann. of Math."},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/j.tcs.2004.11.014","volume":"332","author":"M. Crochemore","year":"2005","unstructured":"Crochemore, M., D\u00e9sarm\u00e9nien, J., Perrin, D.: A note on the Burrows-Wheeler transformation. Theoret. Comput. Sci.\u00a0332, 567\u2013572 (2005)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"13_CR8","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. Journal of Algorithms\u00a04(4), 363\u2013381 (1983)","journal-title":"Journal of Algorithms"},{"issue":"3","key":"13_CR9","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1051\/ita:2002012","volume":"36","author":"J.-P. Duval","year":"2002","unstructured":"Duval, J.-P., Lefebvre, A.: Words over an ordered alphabet and suffix permutations. RAIRO Theor. Inform. Appl.\u00a036(3), 249\u2013259 (2002)","journal-title":"RAIRO Theor. Inform. Appl."},{"issue":"4","key":"13_CR10","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1145\/1082036.1082043","volume":"52","author":"P. Ferragina","year":"2005","unstructured":"Ferragina, P., Giancarlo, R., Manzini, G., Sciortino, M.: Boosting textual compression in optimal linear time. J. ACM\u00a052(4), 688\u2013713 (2005)","journal-title":"J. ACM"},{"key":"13_CR11","unstructured":"Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, pp. 390\u2013398. IEEE Computer Society (2000)"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Fine, N.J., Wilf, H.S.: Uniqueness theorem for periodic functions. Proc. Am. Mathematical Society\u00a0(16), 109\u2013114 (1965)","DOI":"10.2307\/2034009"},{"issue":"2","key":"13_CR13","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0097-3165(93)90095-P","volume":"64","author":"I.M. Gessel","year":"1993","unstructured":"Gessel, I.M., Reutenauer, C.: Counting permutations with given cycle structure and descent set. J. Combin. Theory Ser. A\u00a064(2), 189\u2013215 (1993)","journal-title":"J. Combin. Theory Ser. A"},{"issue":"3","key":"13_CR14","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.tcs.2007.07.019","volume":"387","author":"R. Giancarlo","year":"2007","unstructured":"Giancarlo, R., Restivo, A., Sciortino, M.: From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization. Theoret. Comput. Sci.\u00a0387(3), 236\u2013248 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR15","unstructured":"Gil, J.Y., Scott, D.A.: A bijective string sorting transform. CoRR, abs\/1201.3077 (2012)"},{"issue":"1","key":"13_CR16","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0304-3975(03)00099-9","volume":"307","author":"C. Hohlweg","year":"2003","unstructured":"Hohlweg, C., Reutenauer, C.: Lyndon words, permutations and trees. Theoret. Comput. Sci.\u00a0307(1), 173\u2013178 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-642-31265-6_21","volume-title":"Combinatorial Pattern Matching","author":"W.-K. Hon","year":"2012","unstructured":"Hon, W.-K., Ku, T.-H., Lu, C.-H., Shah, R., Thankachan, S.V.: Efficient algorithm for circular Burrows-Wheeler transform. In: K\u00e4rkk\u00e4inen, J., Stoye, J. (eds.) CPM 2012. LNCS, vol.\u00a07354, pp. 257\u2013268. Springer, Heidelberg (2012)"},{"key":"13_CR18","unstructured":"Kucherov, G., T\u00f3thm\u00e9r\u00e9sz, L., Vialette, S.: On the combinatorics of suffix arrays. CoRR, abs\/1206.3877 (2012)"},{"key":"13_CR19","unstructured":"Kufleitner, M.: On bijective variants of the Burrows-Wheeler transform. In: Proceedings of the Prague Stringology Conference 2009, pp. 65\u201379 (2009)"},{"key":"13_CR20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107341005","volume-title":"Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)","author":"M. Lothaire","year":"2005","unstructured":"Lothaire, M.: Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications). Cambridge University Press, New York (2005)"},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/11496656_16","volume-title":"Combinatorial Pattern Matching","author":"S. Mantaci","year":"2005","unstructured":"Mantaci, S., Restivo, A., Rosone, G., Sciortino, M.: An Extension of the Burrows Wheeler Transform and Applications to Sequence Comparison and Data Compression. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol.\u00a03537, pp. 178\u2013189. Springer, Heidelberg (2005)"},{"issue":"3","key":"13_CR22","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/j.tcs.2007.07.014","volume":"387","author":"S. Mantaci","year":"2007","unstructured":"Mantaci, S., Restivo, A., Rosone, G., Sciortino, M.: An extension of the Burrows-Wheeler Transform. Theoret. Comput. Sci.\u00a0387(3), 298\u2013312 (2007)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"13_CR23","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s00224-007-9078-6","volume":"42","author":"S. Mantaci","year":"2008","unstructured":"Mantaci, S., Restivo, A., Rosone, G., Sciortino, M.: A new combinatorial approach to sequence comparison. Theory Comput. Syst.\u00a042(3), 411\u2013429 (2008)","journal-title":"Theory Comput. Syst."},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"Navarro, G., Nekrich, Y.: Optimal dynamic sequence representations. In: Proc. 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 865\u2013876 (2013)","DOI":"10.1137\/1.9781611973105.62"},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Puglisi, S.J., Smyth, W.F., Turpin, A.H.: A taxonomy of suffix array construction algorithms. ACM Comput. Surv.\u00a039 (2007)","DOI":"10.1145\/1242471.1242472"},{"key":"13_CR26","unstructured":"Seward, J.: The bzip2 home page, \n                    \n                      http:\/\/www.bzip.org"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38771-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T20:20:02Z","timestamp":1557778802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38771-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387708","9783642387715"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38771-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}