{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T18:29:39Z","timestamp":1778005779731,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662482209","type":"print"},{"value":"9783662482216","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-48221-6_14","type":"book-chapter","created":{"date-parts":[[2015,8,27]],"date-time":"2015-08-27T14:14:31Z","timestamp":1440684871000},"page":"189-202","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Optimizing Read Reversals for Sequence Compression"],"prefix":"10.1007","author":[{"given":"Zhong","family":"Sichen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lu","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammadzaman","family":"Zamani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rob","family":"Patro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rezaul","family":"Chowdhury","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Esther M.","family":"Arkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph S. B.","family":"Mitchell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven","family":"Skiena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,28]]},"reference":[{"key":"14_CR1","unstructured":"Adjeroh, D., Zhang, Y., Mukherjee, A., Powell, M., Bell, T.: DNA sequence compression using the Burrows-Wheeler transform. In: Proceedings on Bioinformatics Conference, 2002, pp. 303\u2013313. IEEE Computer Society (2002)"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Bhola, V., Bopardikar, A.S., Narayanan, R., Lee, K., Ahna, T.: No-reference compression of genomic data stored in FASTQ format. In: IEEE International Conference on Bioinformatics and Biomedicine (BIBM 2011), pp. 147\u2013150. IEEE (2011)","DOI":"10.1109\/BIBM.2011.110"},{"issue":"3","key":"14_CR3","doi-asserted-by":"publisher","first-page":"e59190","DOI":"10.1371\/journal.pone.0059190","volume":"8","author":"JK Bonfield","year":"2013","unstructured":"Bonfield, J.K., Mahoney, M.V.: Compression of FASTQ and SAM format sequencing data. PLoS One 8(3), e59190 (2013)","journal-title":"PLoS One"},{"issue":"14","key":"14_CR4","doi-asserted-by":"publisher","first-page":"1731","DOI":"10.1093\/bioinformatics\/btp319","volume":"25","author":"MC Brandon","year":"2009","unstructured":"Brandon, M.C., Wallace, D.C., Baldi, P.: Data structures and compression algorithms for genomic sequence data. Bioinformatics 25(14), 1731\u20131738 (2009)","journal-title":"Bioinformatics"},{"key":"14_CR5","unstructured":"Cazaux, B., Rivals, E.: Approximation of greedy algorithms for max-ATSP, maximal compression, maximal cycle cover, and shortest cyclic cover of strings. In: PSC 2014: Prague Stringology Conference, pp. 148\u2013161. Czech Technical University in Prague, Czech Republic (2014)"},{"key":"14_CR6","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Technical report, DTIC Document (1976)"},{"issue":"11","key":"14_CR7","doi-asserted-by":"publisher","first-page":"1415","DOI":"10.1093\/bioinformatics\/bts173","volume":"28","author":"AJ Cox","year":"2012","unstructured":"Cox, A.J., Bauer, M.J., Jakobi, T., Rosone, G.: Large-scale compression of genomic sequence databases with the Burrows-Wheeler transform. Bioinformatics 28(11), 1415\u20131419 (2012)","journal-title":"Bioinformatics"},{"issue":"1","key":"14_CR8","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1186\/1748-7188-8-25","volume":"8","author":"S Deorowicz","year":"2013","unstructured":"Deorowicz, S., Grabowski, S.: Data compression for sequencing data. Algorithms Mol. Biol. 8(1), 25 (2013)","journal-title":"Algorithms Mol. Biol."},{"key":"14_CR9","unstructured":"Gailly, J., Adler, M.: Gzip program (2014). http:\/\/www.gnu.org\/software\/gzip\/. Accessed 16 June 2014"},{"issue":"23","key":"14_CR10","doi-asserted-by":"publisher","first-page":"3051","DOI":"10.1093\/bioinformatics\/bts593","volume":"28","author":"F Hach","year":"2012","unstructured":"Hach, F., Numanagi\u0107, I., Alkan, C., Sahinalp, S.C.: SCALCE: boosting sequence compression algorithms using locally consistent encoding. Bioinformatics 28(23), 3051\u20133057 (2012)","journal-title":"Bioinformatics"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"e171","DOI":"10.1093\/nar\/gks754","volume":"40","author":"DC Jones","year":"2012","unstructured":"Jones, D.C., Ruzzo, W.L., Peng, X., Katze, M.G.: Compression of next-generation sequencing reads aided by highly efficient de novo assembly. Nucleic Acids Res. 40, e171 (2012)","journal-title":"Nucleic Acids Res."},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-642-03685-9_23","volume-title":"Approximation, Randomization, and Combinatorial Optimization","author":"K Paluch","year":"2009","unstructured":"Paluch, K., Mucha, M., Madry, A.: A 7\/9 - approximation algorithm for the maximum traveling salesman problem. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) Approximation, Randomization, and Combinatorial Optimization. LNCS, vol. 5687, pp. 298\u2013311. Springer, Heidelberg (2009)"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C., Yannakakis, M.: Optimization, approximation, and complexity classes. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pp. 229\u2013234. ACM (1988)","DOI":"10.1145\/62212.62233"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Patro, R., Kingsford, C.: Data-dependent bucketing improves reference-free compression of sequencing reads. Bioinformatics, btv248 (2015)","DOI":"10.1093\/bioinformatics\/btv248"},{"key":"14_CR15","unstructured":"Slavik, P.: Approximation Algorithms for Set Cover and Related Problems. Ph.D. thesis, Buffalo, NY, USA, AAI9833643 (1998)"},{"issue":"17","key":"14_CR16","doi-asserted-by":"publisher","first-page":"2192","DOI":"10.1093\/bioinformatics\/btq346","volume":"26","author":"W Tembe","year":"2010","unstructured":"Tembe, W., Lowey, J., Suh, E.: G-SQZ: compact encoding of genomic sequence and quality data. Bioinformatics 26(17), 2192\u20132194 (2010)","journal-title":"Bioinformatics"},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1137\/S0097539799352735","volume":"30","author":"L Trevisan","year":"2000","unstructured":"Trevisan, L.: When hamming meets euclid: the approximability of geometric TSP and steiner tree. SIAM J. Comput. 30, 475\u2013485 (2000)","journal-title":"SIAM J. Comput."},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Trevisan, L.: When hamming meets euclid: the approximability of geometric TSP and MST. In: Proceedings of the Twenty-ninth Annual ACM Symposium on Theory of Computing, pp. 21\u201329. ACM (1997)","DOI":"10.1145\/258533.258541"},{"issue":"3","key":"14_CR19","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1038\/nbt.3170","volume":"33","author":"YW Yu","year":"2015","unstructured":"Yu, Y.W., Yorukoglu, D., Peng, J., Berger, B.: Quality score compression improves genotyping accuracy. Nat. Biotechnol. 33(3), 240\u2013243 (2015)","journal-title":"Nat. Biotechnol."}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48221-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T11:40:37Z","timestamp":1676029237000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-48221-6_14"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662482209","9783662482216"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48221-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"28 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}