{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T03:53:21Z","timestamp":1772078001250,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642245824","type":"print"},{"value":"9783642245831","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-24583-1_41","type":"book-chapter","created":{"date-parts":[[2011,9,30]],"date-time":"2011-09-30T17:08:23Z","timestamp":1317402503000},"page":"420-425","source":"Crossref","is-referenced-by-count":15,"title":["Reference Sequence Construction for Relative Compression of Genomes"],"prefix":"10.1007","author":[{"given":"Shanika","family":"Kuruppu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon J.","family":"Puglisi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Justin","family":"Zobel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"41_CR1","doi-asserted-by":"crossref","unstructured":"Bentley, J., McIlroy, D.: Data compression using long common strings. In: Proc. Data Compression Conference (DCC 1999), pp. 287\u2013295 (1999)","DOI":"10.1109\/DCC.1999.755678"},{"issue":"14","key":"41_CR2","doi-asserted-by":"publisher","first-page":"1731","DOI":"10.1093\/bioinformatics\/btp319","volume":"25","author":"M. Brandon","year":"2009","unstructured":"Brandon, M., Wallace, D., Baldi, P.: Data structures and compression algorithms for genomic sequence data. Bioinformatics\u00a025(14), 1731\u20131738 (2009)","journal-title":"Bioinformatics"},{"key":"41_CR3","doi-asserted-by":"crossref","unstructured":"Cao, M.D., Dix, T., Allison, L., Mears, C.: A simple statistical algorithm for biological sequence compression. In: Proc. Data Compression Conference (DCC 2007), pp. 43\u201352 (2007)","DOI":"10.1109\/DCC.2007.7"},{"issue":"12","key":"41_CR4","doi-asserted-by":"publisher","first-page":"1696","DOI":"10.1093\/bioinformatics\/18.12.1696","volume":"18","author":"X. Chen","year":"2002","unstructured":"Chen, X., Li, M., Ma, B., Tromp, J.: DNACompress: fast and effective DNA sequence compression. Bioinformatics\u00a018(12), 1696\u20131698 (2002)","journal-title":"Bioinformatics"},{"key":"41_CR5","unstructured":"Grabowski, S., Deorowicz, S.: Engineering relative compression of genomes (2011), http:\/\/arxiv.org\/abs\/1103.2351v1"},{"issue":"6","key":"41_CR6","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1016\/0306-4573(94)90014-0","volume":"30","author":"S. Grumbach","year":"1994","unstructured":"Grumbach, S., Tahi, F.: A new challenge for compression algorithms: Genetic sequences. Information Processing & Management\u00a030(6), 875\u2013886 (1994)","journal-title":"Information Processing & Management"},{"key":"41_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-21458-5_6","volume-title":"Combinatorial Pattern Matching","author":"S. Kreft","year":"2011","unstructured":"Kreft, S., Navarro, G.: Self-indexing based on LZ77. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol.\u00a06661, pp. 41\u201354. Springer, Heidelberg (to apppear, 2011)"},{"key":"41_CR8","doi-asserted-by":"crossref","unstructured":"Kuruppu, S., Beresford-Smith, B., Conway, T., Zobel, J.: Iterative dictionary construction for compression of large DNA datasets. IEEE\/ACM Transactions on Computational Biology and Bioinformatics (to appear, 2011)","DOI":"10.1109\/TCBB.2011.82"},{"key":"41_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.\u00a06393, pp. 201\u2013206. Springer, Heidelberg (2010)"},{"key":"41_CR10","unstructured":"Kuruppu, S., Puglisi, S.J., Zobel, J.: Optimized relative Lempel-Ziv compression of genomes. In: Proc. 34th Australasian Computer Science Conference (ACSC 2011), pp. 91\u201398 (2011)"},{"key":"41_CR11","doi-asserted-by":"crossref","unstructured":"Larsson, N.J., Moffat, A.: Offline dictionary-based compression. In: Proc. Data Compression Conference (DCC 1999), pp. 296\u2013305 (1999)","DOI":"10.1109\/DCC.1999.755679"},{"issue":"3","key":"41_CR12","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1089\/cmb.2009.0169","volume":"17","author":"V. M\u00e4kinen","year":"2010","unstructured":"M\u00e4kinen, V., Navarro, G., Sir\u00e9n, J., V\u00e4lim\u00e4ki, N.: Storage and retrieval of highly repetitive sequence collections. J. Computational Biology\u00a017(3), 281\u2013308 (2010)","journal-title":"J. Computational Biology"},{"issue":"14","key":"41_CR13","first-page":"1397","volume":"34","author":"G. Manzini","year":"2004","unstructured":"Manzini, G., Rastero, M.: A simple and fast DNA compressor. Software: Practice and Experience\u00a034(14), 1397\u20131411 (2004)","journal-title":"Software: Practice and Experience"},{"issue":"3","key":"41_CR14","doi-asserted-by":"publisher","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 Transactions on Information Theory\u00a023(3), 337\u2013343 (1977)","journal-title":"IEEE Transactions on Information Theory"}],"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-642-24583-1_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T08:07:11Z","timestamp":1741766831000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24583-1_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642245824","9783642245831"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24583-1_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}