{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:29:09Z","timestamp":1759638549455},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642331213"},{"type":"electronic","value":"9783642331220"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33122-0_17","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T10:43:09Z","timestamp":1346150589000},"page":"214-224","source":"Crossref","is-referenced-by-count":12,"title":["Comparing DNA Sequence Collections by Direct Comparison of Compressed Text Indexes"],"prefix":"10.1007","author":[{"given":"Anthony J.","family":"Cox","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"Jakobi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanna","family":"Rosone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ole B.","family":"Schulz-Trieglaff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"17_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S1570-8667(03)00065-0","volume":"2","author":"M.I. Abouelhoda","year":"2004","unstructured":"Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. Journal of Discrete Algorithms\u00a02(1), 53\u201386 (2004)","journal-title":"Journal of Discrete Algorithms"},{"key":"17_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-78909-5","volume-title":"The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching","author":"D. Adjeroh","year":"2008","unstructured":"Adjeroh, D., Bell, T., Mukherjee, A.: The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching, 1st edn. Springer Publishing Company, Incorporated (2008)","edition":"1"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-642-21458-5_20","volume-title":"Combinatorial Pattern Matching","author":"M.J. Bauer","year":"2011","unstructured":"Bauer, M.J., Cox, A.J., Rosone, G.: Lightweight BWT Construction for Very Large String Collections. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol.\u00a06661, pp. 219\u2013231. Springer, Heidelberg (2011)"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Bauer, M.J., Cox, A.J., Rosone, G.: Lightweight algorithms for constructing and inverting the BWT of string collections. Theoretical Computer Science (2012) (online February 10, 2012)","DOI":"10.1016\/j.tcs.2012.02.002"},{"key":"17_CR5","unstructured":"Burrows, M., Wheeler, D.J.: A block sorting data compression algorithm. Technical report, DIGITAL System Research Center (1994)"},{"issue":"11","key":"17_CR6","doi-asserted-by":"publisher","first-page":"1415","DOI":"10.1093\/bioinformatics\/bts173","volume":"28","author":"A.J. 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\u00a028(11), 1415\u20131419 (2012)","journal-title":"Bioinformatics"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1109\/SFCS.2000.892127","volume-title":"Proceedings of the 41st Annual Symposium on Foundations of Computer Science","author":"P. Ferragina","year":"2000","unstructured":"Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, pp. 390\u2013398. IEEE Computer Society, Washington, DC (2000)"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Langmead, B., Trapnell, C., Pop, M., Salzberg, S.: Ultrafast and memory-efficient alignment of short DNA sequences to the human genome. Genome Biology\u00a010(3), R25+ (2009)","DOI":"10.1186\/gb-2009-10-3-r25"},{"issue":"14","key":"17_CR9","doi-asserted-by":"publisher","first-page":"1754","DOI":"10.1093\/bioinformatics\/btp324","volume":"25","author":"H. Li","year":"2009","unstructured":"Li, H., Durbin, R.: Fast and accurate short read alignment with Burrows-Wheeler transform. Bioinformatics\u00a025(14), 1754\u20131760 (2009)","journal-title":"Bioinformatics"},{"issue":"15","key":"17_CR10","doi-asserted-by":"publisher","first-page":"1966","DOI":"10.1093\/bioinformatics\/btp336","volume":"25","author":"R. Li","year":"2009","unstructured":"Li, R., Yu, C., Li, Y., Lam, T.W., Yiu, S.M., Kristiansen, K., Wang, J.: Soap2: an improved ultrafast tool for short read alignment. Bioinformatics\u00a025(15), 1966\u20131967 (2009)","journal-title":"Bioinformatics"},{"issue":"3","key":"17_CR11","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/j.tcs.2007.07.014","volume":"387","author":"S. Mantaci","year":"2007","unstructured":"Mantaci, S., Restivo, A., Rosone, G., Sciortino, M.: An extension of the Burrows-Wheeler Transform. Theor. Comput. Sci.\u00a0387(3), 298\u2013312 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"17_CR12","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1016\/j.cell.2011.11.065","volume":"148","author":"E.P. Murchison","year":"2012","unstructured":"Murchison, E.P., Schulz-Trieglaff, O.B., Ning, Z., Alexandrov, L.B., Bauer, M.J., Fu, B., Hims, M., Ding, Z., Ivakhno, S., Stewart, C., Ng, B.L., Wong, W., Aken, B., White, S., Alsop, A., Becq, J., Bignell, G.R., Cheetham, R.K., Cheng, W., Connor, T.R., Cox, A.J., Feng, Z., Gu, Y., Grocock, R.J., Harris, S.R., Khrebtukova, I., Kingsbury, Z., Kowarsky, M., Kreiss, A., Luo, S., Marshall, J., McBride, D.J., Murray, L., Pearse, A., Raine, K., Rasolonjatovo, I., Shaw, R., Tedder, P., Tregidgo, C., Vilella, A.J., Wedge, D.C., Woods, G.M., Gormley, N., Humphray, S., Schroth, G., Smith, G., Hall, K., Searle, S.M.J., Carter, N.P., Papenfuss, A.T., Futreal, P.A., Campbell, P.J., Yang, F., Bentley, D.R., Evers, D.J., Stratton, M.R.: Genome sequencing and analysis of the tasmanian devil and its transmissible cancer. Cell\u00a0148(4), 780\u2013791 (2012)","journal-title":"Cell"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Navarro, G., M\u00e4kinen, V.: Compressed full-text indexes. ACM Comput. Surv.\u00a039(1) (2007)","DOI":"10.1145\/1216370.1216372"},{"issue":"6","key":"17_CR14","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1093\/bioinformatics\/btq033","volume":"26","author":"A.R. Quinlan","year":"2010","unstructured":"Quinlan, A.R., Hall, I.M.: Bedtools: a flexible suite of utilities for comparing genomic features. Bioinformatics\u00a026(6), 841\u2013842 (2010)","journal-title":"Bioinformatics"},{"issue":"12","key":"17_CR15","doi-asserted-by":"crossref","first-page":"i367","DOI":"10.1093\/bioinformatics\/btq217","volume":"26","author":"J.T. Simpson","year":"2010","unstructured":"Simpson, J.T., Durbin, R.: Efficient construction of an assembly string graph using the FM-index. Bioinformatics\u00a026(12), i367\u2013i373 (2010)","journal-title":"Bioinformatics"},{"issue":"3","key":"17_CR16","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1101\/gr.126953.111","volume":"22","author":"J.T. Simpson","year":"2011","unstructured":"Simpson, J.T., Durbin, R.: Efficient de novo assembly of large genomes using compressed data structures. Genome Research\u00a022(3), 549\u2013556 (2011)","journal-title":"Genome Research"},{"issue":"9","key":"17_CR17","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1093\/bioinformatics\/btp120","volume":"25","author":"C. Trapnell","year":"2009","unstructured":"Trapnell, C., Pachter, L., Salzberg, S.L.: Tophat: discovering splice junctions with rna-seq. Bioinformatics\u00a025(9), 1105\u20131111 (2009)","journal-title":"Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33122-0_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T18:31:02Z","timestamp":1643308262000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33122-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642331213","9783642331220"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33122-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}