{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T21:08:28Z","timestamp":1766178508670,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030326852"},{"type":"electronic","value":"9783030326869"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-32686-9_10","type":"book-chapter","created":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T22:02:27Z","timestamp":1570226547000},"page":"138-151","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Inducing the Lyndon Array"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2931-1470","authenticated-orcid":false,"given":"Felipe A.","family":"Louza","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9200-0520","authenticated-orcid":false,"given":"Sabrina","family":"Mantaci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5047-0196","authenticated-orcid":false,"given":"Giovanni","family":"Manzini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6928-0168","authenticated-orcid":false,"given":"Marinella","family":"Sciortino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2608-4807","authenticated-orcid":false,"given":"Guilherme P.","family":"Telles","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,3]]},"reference":[{"key":"10_CR1","unstructured":"Baier, U.: Linear-time suffix sorting \u2013 a new approach for suffix array construction. In: Proceedings of the Annual Symposium on Combinatorial Pattern Matching (CPM), pp. 23:1\u201323:12 (2016)"},{"issue":"5","key":"10_CR2","doi-asserted-by":"publisher","first-page":"1501","DOI":"10.1137\/15M1011032","volume":"46","author":"H Bannai","year":"2017","unstructured":"Bannai, H., Tomohiro, I., Inenaga, S., Nakashima, Y., Takeda, M., Tsuruta, K.: The \u201cruns\u201d theorem. SIAM J. Comput. 46(5), 1501\u20131514 (2017)","journal-title":"SIAM J. Comput."},{"key":"10_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.08.011","author":"M Crochemore","year":"2018","unstructured":"Crochemore, M., Russo, L.M.: Cartesian and Lyndon trees. Theoret. Comput. Sci. (2018). https:\/\/doi.org\/10.1016\/j.tcs.2018.08.011","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Fischer, J.: Inducing the LCP-array. In: Proceedings Workshop on Algorithms and Data Structures (WADS), pp. 374\u2013385 (2011)","DOI":"10.1007\/978-3-642-22300-6_32"},{"key":"10_CR5","unstructured":"Franek, F., Islam, A.S.M.S., Rahman, M.S., Smyth, W.F.: Algorithms to compute the Lyndon array. In: Proceeding of the PSC, pp. 172\u2013184 (2016)"},{"key":"10_CR6","unstructured":"Franek, F., Paracha, A., Smyth, W.F.: The linear equivalence of the suffix array and the partially sorted Lyndon array. In: Proceedings of the PSC, pp. 77\u201384 (2017)"},{"key":"10_CR7","unstructured":"Goto, K., Bannai, H.: Simpler and faster Lempel Ziv factorization. In: 2013 Data Compression Conference, DCC 2013, Snowbird, UT, USA, March 20\u201322, 2013, pp. 133\u2013142 (2013)"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Goto, K., Bannai, H.: Space efficient linear time Lempel-Ziv factorization for small alphabets. In: Proceedings of the IEEE Data Compression Conference (DCC), pp. 163\u2013172 (2014)","DOI":"10.1109\/DCC.2014.62"},{"issue":"1","key":"10_CR9","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. Theor. Comput. Sci. 307(1), 173\u2013178 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR10","unstructured":"Itoh, H., Tanaka, H.: An efficient method for in memory construction of suffix arrays. In: Proceedings of the sixth Symposium on String Processing and Information Retrieval (SPIRE 1999), pp. 81\u201388. IEEE Computer Society Press (1999)"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-44888-8_15","volume-title":"Combinatorial Pattern Matching","author":"P Ko","year":"2003","unstructured":"Ko, P., Aluru, S.: Space efficient linear time construction of suffix arrays. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol. 2676, pp. 200\u2013210. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-44888-8_15"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Kolpakov, R.M., Kucherov, G.: Finding maximal repetitions in a word in linear time. In: Proceedings of the FOCS, pp. 596\u2013604 (1999)","DOI":"10.1007\/3-540-48321-7_31"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.tcs.2017.03.039","volume":"678","author":"FA Louza","year":"2017","unstructured":"Louza, F.A., Gog, S., Telles, G.P.: Inducing enhanced suffix arrays for string collections. Theor. Comput. Sci. 678, 22\u201339 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.ipl.2016.09.010","volume":"118","author":"FA Louza","year":"2017","unstructured":"Louza, F.A., Gog, S., Telles, G.P.: Optimal suffix sorting and LCP array construction for constant alphabets. Inf. Process. Lett. 118, 30\u201334 (2017)","journal-title":"Inf. Process. Lett."},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.jda.2018.08.001","volume":"50","author":"FA Louza","year":"2018","unstructured":"Louza, F.A., Smyth, W.F., Manzini, G., Telles, G.P.: Lyndon array construction during Burrows-Wheeler inversion. J. Discrete Algorithms 50, 2\u20139 (2018)","journal-title":"J. Discrete Algorithms"},{"issue":"5","key":"10_CR16","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U Manber","year":"1993","unstructured":"Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. SIAM J. Comput. 22(5), 935\u2013948 (1993)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10_CR17","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1145\/2493175.2493180","volume":"31","author":"G Nong","year":"2013","unstructured":"Nong, G.: Practical linear-time O(1)-workspace suffix sorting for constant alphabets. ACM Trans. Inf. Syst. 31(3), 15 (2013)","journal-title":"ACM Trans. Inf. Syst."},{"issue":"10","key":"10_CR18","doi-asserted-by":"publisher","first-page":"1471","DOI":"10.1109\/TC.2010.188","volume":"60","author":"G Nong","year":"2011","unstructured":"Nong, G., Zhang, S., Chan, W.H.: Two efficient algorithms for linear time suffix array construction. IEEE Trans. Comput. 60(10), 1471\u20131484 (2011)","journal-title":"IEEE Trans. Comput."},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Nong, G., Zhang, S., Chan, W.H.: Linear suffix array construction by almost pure induced-sorting. In: Proceedings of the IEEE Data Compression Conference (DCC), pp. 193\u2013202 (2009)","DOI":"10.1109\/DCC.2009.42"},{"key":"10_CR20","unstructured":"Ohlebusch, E.: Bioinformatics Algorithms: Sequence Analysis, Genome Rearrangements, and Phylogenetic Reconstruction. Oldenbusch Verlag (2013)"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Okanohara, D., Sadakane, K.: A linear-time Burrows-wheeler transform using induced sorting. In: Proceedings International Symposium on String Processing and Information Retrieval (SPIRE), pp. 90\u2013101 (2009)","DOI":"10.1007\/978-3-642-03784-9_9"},{"issue":"4","key":"10_CR22","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1145\/358841.358852","volume":"23","author":"J Vuillemin","year":"1980","unstructured":"Vuillemin, J.: A unifying look at data structures. Commun. ACM 23(4), 229\u2013239 (1980)","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-32686-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T01:26:38Z","timestamp":1664587598000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-32686-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030326852","9783030326869"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-32686-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"3 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SPIRE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on String Processing and Information Retrieval","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Segovia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/spire19.lbd.org.es\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"59","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}