{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T01:19:44Z","timestamp":1780622384524,"version":"3.54.1"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030326852","type":"print"},{"value":"9783030326869","type":"electronic"}],"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_3","type":"book-chapter","created":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T18:02:27Z","timestamp":1570212147000},"page":"35-44","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Rpair: Rescaling RePair with Rsync"],"prefix":"10.1007","author":[{"given":"Travis","family":"Gagie","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tomohiro","family":"I","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Giovanni","family":"Manzini","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gonzalo","family":"Navarro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hiroshi","family":"Sakamoto","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yoshimasa","family":"Takabatake","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,10,3]]},"reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"publisher","first-page":"319","DOI":"10.3390\/a6020319","volume":"6","author":"A Abeliuk","year":"2013","unstructured":"Abeliuk, A., C\u00e1novas, R., Navarro, G.: Practical compressed suffix trees. Algorithms 6(2), 319\u2013351 (2013)","journal-title":"Algorithms"},{"key":"3_CR2","unstructured":"Bannai, H., Gagie, T., I, T.: Online LZ77 parsing and matching statistics with RLBWTs. In: CPM, pp. 7:1\u20137:12 (2018)"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Belazzougui, D., Cording, P.H., Puglisi, S.J., Tabei, Y.: Access, rank, and select in grammar-compressed strings. In: ESA, pp. 142\u2013154 (2015)","DOI":"10.1007\/978-3-662-48350-3_13"},{"key":"3_CR4","unstructured":"Bille, P., Ettienne, M.B., G\u00f8rtz, I.L., Vildh\u00f8j, H.W.: Time-space trade-offs for Lempel-Ziv compressed indexing. In: CPM, pp. 16:1\u201316:17 (2017)"},{"issue":"3","key":"3_CR5","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."},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Boucher, C., Gagie, T., Kuhnle, A., Manzini, G.: Prefix-free parsing for building big BWTs. In: WABI, pp. 2:1\u20132:16 (2018)","DOI":"10.1101\/472399"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.ins.2019.01.035","volume":"483","author":"N Brisaboa","year":"2019","unstructured":"Brisaboa, N., G\u00f3mez-Brand\u00f3n, A., Navarro, G., Param\u00e1, J.: Gract: a grammar-based compressed index for trajectory data. Inf. Sci. 483, 106\u2013135 (2019)","journal-title":"Inf. Sci."},{"issue":"7","key":"3_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"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-319-77404-6_25","volume-title":"LATIN 2018: Theoretical Informatics","author":"AR Christiansen","year":"2018","unstructured":"Christiansen, A.R., Ettienne, M.B.: Compressed indexing with signature grammars. In: Bender, M.A., Farach-Colton, M., Mosteiro, M.A. (eds.) LATIN 2018. LNCS, vol. 10807, pp. 331\u2013345. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-77404-6_25"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.is.2016.04.002","volume":"61","author":"F Claude","year":"2016","unstructured":"Claude, F., Fari\u00f1a, A., Mart\u00ednez-Prieto, M., Navarro, G.: Universal indexes for highly repetitive document collections. Inf. Sys. 61, 1\u201323 (2016)","journal-title":"Inf. Sys."},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-319-02432-5_12","volume-title":"String Processing and Information Retrieval","author":"F Claude","year":"2013","unstructured":"Claude, F., Munro, J.I.: Document listing on versioned documents. In: Kurland, O., Lewenstein, M., Porat, E. (eds.) SPIRE 2013. LNCS, vol. 8214, pp. 72\u201383. Springer, Cham (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-319-02432-5_12"},{"issue":"3","key":"3_CR12","first-page":"313","volume":"111","author":"F Claude","year":"2010","unstructured":"Claude, F., Navarro, G.: Self-indexed grammar-based compression. Fund. Inf. 111(3), 313\u2013337 (2010)","journal-title":"Fund. Inf."},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-642-34109-0_19","volume-title":"String Processing and Information Retrieval","author":"F Claude","year":"2012","unstructured":"Claude, F., Navarro, G.: Improved grammar-based compressed indexes. In: Calder\u00f3n-Benavides, L., Gonz\u00e1lez-Caro, C., Ch\u00e1vez, E., Ziviani, N. (eds.) SPIRE 2012. LNCS, vol. 7608, pp. 180\u2013192. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-34109-0_19"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Furuya, I., Takagi, T., Nakashima, Y., Inenaga, S., Bannai, H., Kida, T.: MR-RePair: grammar compression based on maximal repeats. In: DCC, pp. 508\u2013517 (2019)","DOI":"10.1109\/DCC.2019.00059"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1007\/978-3-642-54423-1_63","volume-title":"LATIN 2014: Theoretical Informatics","author":"T Gagie","year":"2014","unstructured":"Gagie, T., Gawrychowski, P., K\u00e4rkk\u00e4inen, J., Nekrich, Y., Puglisi, S.J.: LZ77-based self-indexing with faster pattern matching. In: Pardo, A., Viola, A. (eds.) LATIN 2014. LNCS, vol. 8392, pp. 731\u2013742. Springer, Heidelberg (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-642-54423-1_63"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.tcs.2015.05.027","volume":"592","author":"A Je\u017c","year":"2015","unstructured":"Je\u017c, A.: Approximation of grammar-based compression via recompression. Theor. Comput. Sci. 592, 115\u2013134 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.tcs.2015.12.032","volume":"616","author":"A Je\u017c","year":"2016","unstructured":"Je\u017c, A.: A really simple approximation of smallest grammar. Theor. Comput. Sci. 616, 141\u2013150 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"K\u00e4rkk\u00e4inen, J., Kempa, D., Puglisi, S.J.: Lempel-Ziv parsing in external memory. In: DCC, pp. 153\u2013162 (2014)","DOI":"10.1109\/DCC.2014.78"},{"issue":"3","key":"3_CR19","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":"3_CR20","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.diin.2006.06.015","volume":"3","author":"JD Kornblum","year":"2006","unstructured":"Kornblum, J.D.: Identifying almost identical files using context triggered piecewise hashing. Digit. Invest. 3, 91\u201397 (2006)","journal-title":"Digit. Invest."},{"issue":"11","key":"3_CR21","doi-asserted-by":"publisher","first-page":"1722","DOI":"10.1109\/5.892708","volume":"88","author":"J Larsson","year":"2000","unstructured":"Larsson, J., Moffat, A.: Off-line dictionary-based compression. Proc. IEEE 88(11), 1722\u20131732 (2000)","journal-title":"Proc. IEEE"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Lasch, R., Oukid, I., Dementiev, R., May, N., Demirsoy, S.S., Sattler, K.-U.: Fast & strong: The case of compressed string dictionaries on modern CPUs. In: DaMoN, pp. 4:1\u20134:10 (2019)","DOI":"10.1145\/3329785.3329924"},{"issue":"1","key":"3_CR23","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"},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-642-35926-2_29","volume-title":"Combinatorial Algorithms","author":"G Navarro","year":"2012","unstructured":"Navarro, G.: Indexing highly repetitive collections. In: Arumugam, S., Smyth, W.F. (eds.) IWOCA 2012. LNCS, vol. 7643, pp. 274\u2013279. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-35926-2_29"},{"key":"3_CR25","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1613\/jair.374","volume":"7","author":"CG Nevill-Manning","year":"1997","unstructured":"Nevill-Manning, C.G., Witten, I.H.: Identifying hierarchical structure in sequences: a linear-time algorithm. J. Artif. Intell. Res. 7, 67\u201382 (1997)","journal-title":"J. Artif. Intell. Res."},{"key":"3_CR26","unstructured":"Nishimoto, T., I, T., Inenaga, S., Bannai, H., Takeda, M.: Dynamic index, LZ factorization, and LCE queries in compressed space. CoRR, abs\/1504.06954 (2015)"},{"issue":"11","key":"3_CR27","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1093\/bioinformatics\/bts174","volume":"28","author":"Y Peng","year":"2012","unstructured":"Peng, Y., Leung, H.C.M., Yiu, S.M., Chin, F.Y.L.: IDBA-UD: a de novo assembler for single-cell and metagenomic sequencing data with highly uneven depth. Bioinformatics 28(11), 1420\u20131428 (2012)","journal-title":"Bioinformatics"},{"issue":"1\u20133","key":"3_CR28","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. Theor. Comput. Sci. 302(1\u20133), 211\u2013222 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"2\u20134","key":"3_CR29","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1016\/j.jda.2004.08.016","volume":"3","author":"H Sakamoto","year":"2005","unstructured":"Sakamoto, H.: A fully linear-time approximation algorithm for grammar-based compression. J. Discr. Algorithm 3(2\u20134), 416\u2013430 (2005)","journal-title":"J. Discr. Algorithm"},{"issue":"4","key":"3_CR30","doi-asserted-by":"publisher","first-page":"928","DOI":"10.1145\/322344.322346","volume":"29","author":"JA Storer","year":"1982","unstructured":"Storer, J.A., Szymanski, T.G.: Data compression via textual substitution. J. ACM 29(4), 928\u2013951 (1982)","journal-title":"J. ACM"},{"key":"3_CR31","unstructured":"Takabatake, Y., I, T., Sakamoto, H.: A space-optimal grammar compression. In: ESA, pp. 67:1\u201367:15 (2017)"},{"key":"3_CR32","unstructured":"Tridgell, A.: Efficient Algorithms for Sorting and Synchronization. Ph.D. thesis, The Australian National University (1999)"},{"issue":"3","key":"3_CR33","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"IT\u201323","author":"J Ziv","year":"1977","unstructured":"Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Trans. Inf. Theory IT\u201323(3), 337\u2013349 (1977)","journal-title":"IEEE Trans. Inf. Theory"}],"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_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T21:05:38Z","timestamp":1570223138000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-32686-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030326852","9783030326869"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-32686-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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)"}}]}}