{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:41:04Z","timestamp":1743046864081,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031555978"},{"type":"electronic","value":"9783031555985"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-55598-5_10","type":"book-chapter","created":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T18:01:53Z","timestamp":1709661713000},"page":"146-161","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Space-Efficient Conversions from\u00a0SLPs"],"prefix":"10.1007","author":[{"given":"Travis","family":"Gagie","sequence":"first","affiliation":[]},{"given":"Adri\u00e1n","family":"Goga","sequence":"additional","affiliation":[]},{"given":"Artur","family":"Je\u017c","sequence":"additional","affiliation":[]},{"given":"Gonzalo","family":"Navarro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,6]]},"reference":[{"key":"10_CR1","unstructured":"Alstrup, S., Brodal, G.S., Rauhe, T.: Pattern matching in dynamic texts. In: SODA, pp. 819\u2013828 (2000)"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Arimura, H., Inenaga, S., Kobayashi, Y., Nakashima, Y., Sue, M.: Optimally computing compressed indexing arrays based on the compact directed acyclic word graph. In: International Symposium on String Processing and Information Retrieval, pp. 28\u201334 (2023)","DOI":"10.1007\/978-3-031-43980-3_3"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Belazzougui, D., Boldi, P., Pagh, R., Vigna, S.: Fast prefix search in little space, with applications. In: 18th European Symposium on Algorithms (ESA), Part I, pp. 427\u2013438 (2010)","DOI":"10.1007\/978-3-642-15775-2_37"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Belazzougui, D., Puglisi, S.J.: Range predecessor and Lempel-Ziv parsing. In: 27th Symposium on Discrete Algorithms (SODA), pp. 2053\u20132071 (2016)","DOI":"10.1137\/1.9781611974331.ch143"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: LATIN, pp. 88\u201394 (2000)","DOI":"10.1007\/10719839_9"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.jcss.2017.01.002","volume":"86","author":"P Bille","year":"2017","unstructured":"Bille, P., G\u00f8rtz, I.L., Cording, P.H., Sach, B., Vildh\u00f8j, H.W., Vind, S.: Fingerprints in compressed strings. J. Comput. Syst. Sci. 86, 171\u2013180 (2017)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"10_CR7","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/130936889","volume":"44","author":"P Bille","year":"2015","unstructured":"Bille, P., Landau, G.M., Raman, R., Sadakane, K., Rao, S.S., Weimann, O.: Random access to grammar-compressed strings and trees. SIAM J. Comput. 44(3), 513\u2013539 (2015)","journal-title":"SIAM J. Comput."},{"issue":"7","key":"10_CR8","doi-asserted-by":"publisher","first-page":"2554","DOI":"10.1109\/TIT.2005.850116","volume":"51","author":"M Charikar","year":"2005","unstructured":"Charikar, M., et al.: The smallest grammar problem. IEEE Trans. Inf. Theory 51(7), 2554\u20132576 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"10_CR9","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1137\/0217026","volume":"17","author":"B Chazelle","year":"1988","unstructured":"Chazelle, B.: A functional approach to data structures and its use in multidimensional searching. SIAM J. Comput. 17(3), 427\u2013462 (1988)","journal-title":"SIAM J. Comput."},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Christiansen, A.R., Ettienne, M.B., Kociumaka, T., Navarro, G., Prezza, N.: Optimal-time dictionary-compressed indexes. ACM Trans. Algorithms 17(1), article 8 (2020)","DOI":"10.1145\/3426473"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.jcss.2020.12.001","volume":"118","author":"F Claude","year":"2021","unstructured":"Claude, F., Navarro, G., Pacheco, A.: Grammar-compressed indexes with logarithmic search time. J. Comput. Syst. Sci. 118, 53\u201374 (2021)","journal-title":"J. Comput. Syst. Sci."},{"issue":"7571","key":"10_CR12","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1038\/nature15393","volume":"526","author":"RM Durbin","year":"2015","unstructured":"Durbin, R.M., Auton, A., Brooks, L.D.: A global reference for human genetic variation. Nature 526(7571), 68\u201374 (2015)","journal-title":"Nature"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Gagie, T., Navarro, G., Prezza, N.: Fully-functional suffix trees and optimal text searching in BWT-runs bounded space. J. ACM 67(1), article 2 (2020)","DOI":"10.1145\/3375890"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Ganardi, M., Je\u017c, A., Lohrey, M.: Balancing straight-line programs. J. ACM 68(4), 27:1\u201327:40 (2021)","DOI":"10.1145\/3457389"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Gawrychowski, P.: Pattern matching in Lempel-Ziv compressed strings: fast, simple, and deterministic. In: European Symposium on Algorithms, pp. 421\u2013432 (2011)","DOI":"10.1007\/978-3-642-23719-5_36"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Gawrychowski, P., Karczmarz, A., Kociumaka, T., \u0141\u0105cki, J., Sankowski, P.: Optimal dynamic strings. In: 29th ACM-SIAM Symposium on Discrete Algorithms, pp. 1509\u20131528 (2018)","DOI":"10.1137\/1.9781611975031.99"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Gawrychowski, P., Kociumaka, T.: Sparse suffix tree construction in optimal time and space. In: 28th ACM-SIAM Symposium on Discrete Algorithms, pp. 425\u2013439. SIAM (2017)","DOI":"10.1137\/1.9781611974782.27"},{"key":"10_CR18","unstructured":"Tomohiro, I.: Longest common extensions with recompression. In: 28th Symposium on Combinatorial Pattern Matching (CPM), pp. 18:1\u201318:15 (2017)"},{"issue":"3","key":"10_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2631920","volume":"11","author":"A Je\u017c","year":"2015","unstructured":"Je\u017c, A.: Faster fully compressed pattern matching by recompression. ACM Trans. Algorithms (TALG) 11(3), 1\u201343 (2015)","journal-title":"ACM Trans. Algorithms (TALG)"},{"issue":"6","key":"10_CR20","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1145\/1217856.1217858","volume":"53","author":"J K\u00e4rkk\u00e4inen","year":"2006","unstructured":"K\u00e4rkk\u00e4inen, J., Sanders, P., Burkhardt, S.: Linear work suffix array construction. J. ACM 53(6), 918\u2013936 (2006)","journal-title":"J. ACM"},{"issue":"2","key":"10_CR21","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1147\/rd.312.0249","volume":"31","author":"RM Karp","year":"1987","unstructured":"Karp, R.M., Rabin, M.O.: Efficient randomized pattern-matching algorithms. IBM J. Res. Dev. 31(2), 249\u2013260 (1987)","journal-title":"IBM J. Res. Dev."},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Kempa, D., Kociumaka, T.: Resolution of the Burrows-Wheeler Transform conjecture. In: 61st IEEE Symposium on Foundations of Computer Science (FOCS), pp. 1002\u20131013 (2020)","DOI":"10.1109\/FOCS46700.2020.00097"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Kempa, D., Kociumaka, T.: Collapsing the hierarchy of compressed data structures: Suffix arrays in optimal compressed space. In: 63rd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 1877\u20131886 (2023)","DOI":"10.1109\/FOCS57990.2023.00114"},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Kempa, D., Kosolobov, D.: LZ-End parsing in compressed space. In: 27th Data Compression Conference (DCC), pp. 350\u2013359 (2017)","DOI":"10.1109\/DCC.2017.73"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Kempa, D., Prezza, N.: At the roots of dictionary compression: string attractors. In: 50th ACM SIGACT Symposium on Theory of Computing, pp. 827\u2013840 (2018)","DOI":"10.1145\/3188745.3188814"},{"issue":"3","key":"10_CR26","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1109\/18.841160","volume":"46","author":"JC Kieffer","year":"2000","unstructured":"Kieffer, J.C., Yang, E.-H.: Grammar-based codes: a new class of universal lossless source codes. IEEE Trans. Inf. Theory 46(3), 737\u2013754 (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Kociumaka, T., Navarro, G., Olivares, F.: Near-optimal search time in $$\\delta $$-optimal space. Algorithmica (2023). accepted, available online","DOI":"10.1007\/s00453-023-01186-0"},{"issue":"4","key":"10_CR28","doi-asserted-by":"publisher","first-page":"2074","DOI":"10.1109\/TIT.2022.3224382","volume":"69","author":"T Kociumaka","year":"2023","unstructured":"Kociumaka, T., Navarro, G., Prezza, N.: Toward a definitive compressibility measure for repetitive sequences. IEEE Trans. Inf. Theory 69(4), 2074\u20132092 (2023)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"10_CR29","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/TIT.1976.1055501","volume":"22","author":"A Lempel","year":"1976","unstructured":"Lempel, A., Ziv, J.: On the complexity of finite sequences. IEEE Trans. Inf. Theory 22(1), 75\u201381 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"10_CR30","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/BF02522825","volume":"17","author":"K Mehlhorn","year":"1997","unstructured":"Mehlhorn, K., Sundar, R., Uhrig, C.: Maintaining dynamic sequences under equality tests in polylogarithmic time. Algorithmica 17(2), 183\u2013198 (1997)","journal-title":"Algorithmica"},{"key":"10_CR31","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.jda.2013.07.004","volume":"25","author":"G Navarro","year":"2014","unstructured":"Navarro, G.: Wavelet trees for all. J. Dis. Algorithms 25, 2\u201320 (2014)","journal-title":"J. Dis. Algorithms"},{"key":"10_CR32","doi-asserted-by":"crossref","unstructured":"Navarro, G.: Indexing highly repetitive string collections, part I: repetitiveness measures. ACM Comput. Surv. 54(2), article 29 (2021)","DOI":"10.1145\/3434399"},{"key":"10_CR33","doi-asserted-by":"crossref","unstructured":"Navarro, G.: Computing MEMs on repetitive text collections. In: 34th Symposium on Combinatorial Pattern Matching (CPM), page article 22 (2023)","DOI":"10.1145\/3701561"},{"issue":"2","key":"10_CR34","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.1109\/TIT.2020.3042746","volume":"67","author":"G Navarro","year":"2020","unstructured":"Navarro, G., Ochoa, C., Prezza, N.: On the approximation ratio of ordered parsings. IEEE Trans. Inf. Theory 67(2), 1008\u20131026 (2020)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10_CR35","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.tcs.2018.09.007","volume":"762","author":"G Navarro","year":"2019","unstructured":"Navarro, G., Prezza, N.: Universal compressed text indexing. Theoret. Comput. Sci. 762, 41\u201350 (2019)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR36","doi-asserted-by":"crossref","unstructured":"Nishimoto, T., Tomohiro, I., Inenaga, S., Bannai, H., Takeda, M.: Dynamic index and LZ factorization in compressed space. Discret. Appl. Math. 274, 116\u2013129 (2020)","DOI":"10.1016\/j.dam.2019.01.014"},{"key":"10_CR37","unstructured":"Policriti, A., Prezza, N.: From LZ77 to the run-length encoded burrows-wheeler transform, and back. In: 28th Symposium on Combinatorial Pattern Matching (CPM). LIPIcs, vol. 78, pp. 17:1\u201317:10 (2017)"},{"issue":"1\u20133","key":"10_CR38","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0304-3975(02)00777-6","volume":"302","author":"W Rytter","year":"2003","unstructured":"Rytter, W.: Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theoret. Comput. Sci. 302(1\u20133), 211\u2013222 (2003)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","LATIN 2024: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-55598-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,13]],"date-time":"2024-11-13T21:30:39Z","timestamp":1731533439000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-55598-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031555978","9783031555985"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-55598-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"6 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Puerto Varas","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chile","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/latin2024.cmm.uchile.cl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"92","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":"44","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":"0","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":"48% - 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.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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}