{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:11Z","timestamp":1760202611606},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642214578"},{"type":"electronic","value":"9783642214585"}],"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-21458-5_20","type":"book-chapter","created":{"date-parts":[[2011,6,27]],"date-time":"2011-06-27T21:11:27Z","timestamp":1309209087000},"page":"219-231","source":"Crossref","is-referenced-by-count":20,"title":["Lightweight BWT Construction for Very Large String Collections"],"prefix":"10.1007","author":[{"given":"Markus J.","family":"Bauer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anthony J.","family":"Cox","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanna","family":"Rosone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","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, Heidelberg (2008)","edition":"1"},{"issue":"7218","key":"20_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1038\/nature07517","volume":"456","author":"D.R. Bentley","year":"2008","unstructured":"Bentley, D.R., et al.: Accurate whole human genome sequencing using reversible terminator chemistry. Nature\u00a0456(7218), 53\u201359 (2008)","journal-title":"Nature"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1007\/978-3-642-12200-2_60","volume-title":"LATIN 2010: Theoretical Informatics","author":"P. Ferragina","year":"2010","unstructured":"Ferragina, P., Gagie, T., Manzini, G.: Lightweight data indexing and compression in external memory. In: L\u00f3pez-Ortiz, A. (ed.) LATIN 2010. LNCS, vol.\u00a06034, pp. 697\u2013710. Springer, Heidelberg (2010)"},{"key":"20_CR4","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, Washington, DC, USA, pages 390. IEEE Computer Society, Los Alamitos (2000)"},{"key":"20_CR5","doi-asserted-by":"publisher","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\u00a052, 552\u2013581 (2005)","journal-title":"J. ACM"},{"key":"20_CR6","unstructured":"National Center for Biotechnology Information. Sequence Read Archive, \n                    \n                      http:\/\/trace.ncbi.nlm.nih.gov\/Traces\/sra\/sra.cgi?"},{"key":"20_CR7","first-page":"66","volume-title":"New indices for text: PAT Trees and PAT arrays","author":"G.H. Gonnet","year":"1992","unstructured":"Gonnet, G.H., Baeza-Yates, R.A., Snider, T.: New indices for text: PAT Trees and PAT arrays, pp. 66\u201382. Prentice-Hall, Inc., Upper Saddle River (1992)"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s00453-006-1228-8","volume":"48","author":"W.K. Hon","year":"2007","unstructured":"Hon, W.K., Lam, T.W., Sadakane, K., Sung, W.K., Yiu, S.M.: A space and time efficient algorithm for constructing compressed suffix arrays. Algorithmica\u00a048, 23\u201336 (2007)","journal-title":"Algorithmica"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1145\/1217856.1217858","volume":"53","author":"J. K\u00e4rkk\u00e4inen","year":"2006","unstructured":"K\u00e4rkk\u00e4inen, J., Sanders, P., Burkhardt, S.: Linear work suffix array construction. J. ACM\u00a053, 918\u2013936 (2006)","journal-title":"J. ACM"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-44888-8_14","volume-title":"Combinatorial Pattern Matching","author":"D. Kim","year":"2003","unstructured":"Kim, D., Sim, J., Park, H., Park, K.: Linear-time construction of suffix arrays. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 186\u2013199. Springer, Heidelberg (2003)"},{"issue":"2-4","key":"20_CR11","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.jda.2004.08.002","volume":"3","author":"P. Ko","year":"2005","unstructured":"Ko, P., Aluru, S.: Space efficient linear time construction of suffix arrays. Journal of Discrete Algorithms\u00a03(2-4), 143\u2013156 (2005)","journal-title":"Journal of Discrete Algorithms"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/11496656_16","volume-title":"Combinatorial Pattern Matching","author":"S. Mantaci","year":"2005","unstructured":"Mantaci, S., Restivo, A., Rosone, G., Sciortino, M.: An extension of the burrows wheeler transform and applications to sequence comparison and data compression. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol.\u00a03537, pp. 178\u2013189. Springer, Heidelberg (2005)"},{"issue":"3","key":"20_CR13","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":"3","key":"20_CR14","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s00224-007-9078-6","volume":"42","author":"S. Mantaci","year":"2008","unstructured":"Mantaci, S., Restivo, A., Rosone, G., Sciortino, M.: A new combinatorial approach to sequence comparison. Theory Comput. Syst.\u00a042(3), 411\u2013429 (2008)","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"20_CR15","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1038\/nrg2626","volume":"11","author":"M.L. Metzker","year":"2009","unstructured":"Metzker, M.L.: Sequencing technologies \u2013 the next generation. Nature Reviews Genetics\u00a011(1), 31\u201346 (2009)","journal-title":"Nature Reviews Genetics"},{"key":"20_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-642-02441-2_6","volume-title":"Combinatorial Pattern Matching","author":"G. Nong","year":"2009","unstructured":"Nong, G., Zhang, S., Chan, W.H.: Linear time suffix array construction using d-critical substrings. In: Kucherov, G., Ukkonen, E. (eds.) CPM 2009 Lille. LNCS, vol.\u00a05577, pp. 54\u201367. Springer, Heidelberg (2009)"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Puglisi, S.J., Smyth, W.F., Turpin, A.H.: A taxonomy of suffix array construction algorithms. ACM Comput. Surv.\u00a039 (July 2007)","DOI":"10.1145\/1242471.1242472"},{"issue":"7","key":"20_CR18","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1089\/cmb.2005.12.943","volume":"12","author":"B.P. Walenz","year":"2005","unstructured":"Walenz, B.P., Lippert, R.A., Mobarry, C.M.: A Space-Efficient Construction of the Burrows-Wheeler Transform for Genomic Data. Journal of Computational Biology\u00a012(7), 943\u2013951 (2005)","journal-title":"Journal of Computational Biology"},{"issue":"12","key":"20_CR19","doi-asserted-by":"publisher","first-page":"367","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"},{"key":"20_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-642-03784-9_7","volume-title":"String Processing and Information Retrieval","author":"J. Sir\u00e9n","year":"2009","unstructured":"Sir\u00e9n, J.: Compressed suffix arrays for massive data. In: Karlgren, J., Tarhio, J., Hyyr\u00f6, H. (eds.) SPIRE 2009. LNCS, vol.\u00a05721, pp. 63\u201374. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21458-5_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T13:31:01Z","timestamp":1553866261000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21458-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642214578","9783642214585"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21458-5_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}