{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:29:03Z","timestamp":1759638543413},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319460482"},{"type":"electronic","value":"9783319460499"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-46049-9_1","type":"book-chapter","created":{"date-parts":[[2016,9,20]],"date-time":"2016-09-20T15:02:06Z","timestamp":1474383726000},"page":"1-14","source":"Crossref","is-referenced-by-count":2,"title":["RLZAP: Relative Lempel-Ziv with Adaptive Pointers"],"prefix":"10.1007","author":[{"given":"Anthony J.","family":"Cox","sequence":"first","affiliation":[]},{"given":"Andrea","family":"Farruggia","sequence":"additional","affiliation":[]},{"given":"Travis","family":"Gagie","sequence":"additional","affiliation":[]},{"given":"Simon J.","family":"Puglisi","sequence":"additional","affiliation":[]},{"given":"Jouni","family":"Sir\u00e9n","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,21]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J Ziv","year":"1977","unstructured":"Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Trans. Inf. Theor. 23, 337\u2013343 (1977)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/978-3-642-16321-0_20","volume-title":"String Processing and Information Retrieval","author":"S Kuruppu","year":"2010","unstructured":"Kuruppu, S., Puglisi, S.J., Zobel, J.: Relative Lempel-Ziv compression of genomes for large-scale storage and retrieval. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol. 6393, pp. 201\u2013206. Springer, Heidelberg (2010)"},{"key":"1_CR3","doi-asserted-by":"crossref","first-page":"1270","DOI":"10.1109\/18.243444","volume":"39","author":"J Ziv","year":"1993","unstructured":"Ziv, J., Merhav, N.: A measure of relative entropy between individual sequences with application to universal classification. IEEE Trans. Inf. Theor. 39, 1270\u20131279 (1993)","journal-title":"IEEE Trans. Inf. Theor."},{"doi-asserted-by":"crossref","unstructured":"Hoobin, C., Puglisi, S.J., Zobel, J.: Sample selection for dictionary-based corpus compression. In: Proceedings of SIGIR, pp. 1137\u20131138 (2011)","key":"1_CR4","DOI":"10.1145\/2009916.2010087"},{"key":"1_CR5","doi-asserted-by":"crossref","first-page":"265","DOI":"10.14778\/2078331.2078341","volume":"5","author":"C Hoobin","year":"2011","unstructured":"Hoobin, C., Puglisi, S.J., Zobel, J.: Relative Lempel-Ziv factorization for efficient storage and retrieval of web collections. Proc. VLDB 5, 265\u2013273 (2011)","journal-title":"Proc. VLDB"},{"key":"1_CR6","doi-asserted-by":"crossref","first-page":"2979","DOI":"10.1093\/bioinformatics\/btr505","volume":"27","author":"S Deorowicz","year":"2011","unstructured":"Deorowicz, S., Grabowski, S.: Robust relative compression of genomes with random access. Bioinformatics 27, 2979\u20132986 (2011)","journal-title":"Bioinformatics"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/978-3-319-11918-2_2","volume-title":"String Processing and Information Retrieval","author":"H Ferrada","year":"2014","unstructured":"Ferrada, H., Gagie, T., Gog, S., Puglisi, S.J.: Relative Lempel-Ziv with constant-time random access. In: Moura, E., Crochemore, M. (eds.) SPIRE 2014. LNCS, vol. 8799, pp. 13\u201317. Springer, Heidelberg (2014)"},{"doi-asserted-by":"crossref","unstructured":"K\u00e4rkk\u00e4inen, J., Kempa, D., Puglisi, S.J.: Hybrid compression of bitvectors for the FM-index. In: Proceedings of DCC, pp. 302\u2013311 (2014)","key":"1_CR8","DOI":"10.1109\/DCC.2014.87"},{"key":"1_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/srep11565","volume":"5","author":"S Deorowicz","year":"2015","unstructured":"Deorowicz, S., Danek, A., Niemiec, M.: GDC2: compression of large collections of genomes. Sci. Rep. 5, 1\u201312 (2015)","journal-title":"Sci. Rep."},{"key":"1_CR10","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1145\/1082036.1082039","volume":"52","author":"P Ferragina","year":"2005","unstructured":"Ferragina, P., Manzini, G.: Indexing compressed text. J. ACM 52, 552\u2013581 (2005)","journal-title":"J. ACM"},{"unstructured":"Burrows, M., Wheeler, D.J.: A block sorting lossless data compression algorithm. Technical report 124, Digital Equipment Corporation (1994)","key":"1_CR11"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/978-3-319-11918-2_6","volume-title":"String Processing and Information Retrieval","author":"D Belazzougui","year":"2014","unstructured":"Belazzougui, D., Gagie, T., Gog, S., Manzini, G., Sir\u00e9n, J.: Relative FM-indexes. In: Moura, E., Crochemore, M. (eds.) SPIRE 2014. LNCS, vol. 8799, pp. 52\u201364. Springer, Heidelberg (2014)"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/978-3-319-23826-5_15","volume-title":"String Processing and Information Retrieval","author":"C Boucher","year":"2015","unstructured":"Boucher, C., Bowe, A., Gagie, T., Manzini, G., Sir\u00e9n, J.: Relative select. In: Iliopoulos, C., Puglisi, S., Yilmaz, E. (eds.) SPIRE 2015. LNCS, vol. 9309, pp. 149\u2013155. Springer, Heidelberg (2015)"},{"key":"1_CR14","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.jda.2011.01.002","volume":"11","author":"M L\u00e9onard","year":"2012","unstructured":"L\u00e9onard, M., Mouchard, L., Salson, M.: On the number of elements to reorder when updating a suffix array. J. Discrete Algorithms 11, 87\u201399 (2012)","journal-title":"J. Discrete Algorithms"},{"unstructured":"Gagie, T., Navarro, G., Puglisi, S.J., Sir\u00e9n, J.: Relative compressed suffix trees. Technical report 1508.02550 (2015). arxiv.org","key":"1_CR15"},{"doi-asserted-by":"crossref","unstructured":"Okanohara, D., Sadakane, K.: Practical entropy-compressed rank\/select dictionary. In: Proceedings of ALENEX (2007)","key":"1_CR16","DOI":"10.1137\/1.9781611972870.6"},{"key":"1_CR17","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/1290672.1290680","volume":"3","author":"R Raman","year":"2007","unstructured":"Raman, R., Raman, V., Satti, S.R.: Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. ACM Trans. Algorithms 3, 43 (2007)","journal-title":"ACM Trans. Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Farruggia, A., Ferragina, P., Venturini, R.: Bicriteria data compression. In: Proceedings of SODA, pp. 1582\u20131595 (2014)","key":"1_CR18","DOI":"10.1137\/1.9781611973402.115"},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1007\/978-3-662-44777-2_34","volume-title":"Algorithms - ESA 2014","author":"A Farruggia","year":"2014","unstructured":"Farruggia, A., Ferragina, P., Venturini, R.: Bicriteria data compression: efficient and usable. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 406\u2013417. Springer, Heidelberg (2014)"},{"doi-asserted-by":"crossref","unstructured":"Brudno, M., Malde, S., Poliakov, A., Do, C.B., Couronne, O., Dubchak, I., Batzoglou, S.: Glocal alignment: finding rearrangements during alignment. In: Proceedings of ISMB, pp. 54\u201362 (2003)","key":"1_CR20","DOI":"10.1093\/bioinformatics\/btg1005"},{"unstructured":"Kubincov\u00e1, P.: Mapping between genomes. Bachelor thesis, Comenius University, Slovakia Supervised by Bro\u0148a Brejov\u00e1 (2014)","key":"1_CR21"}],"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-46049-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T23:15:22Z","timestamp":1498346122000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-46049-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319460482","9783319460499"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-46049-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}