{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:03:42Z","timestamp":1725455022870},"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_26","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T10:43:09Z","timestamp":1346150589000},"page":"326-337","source":"Crossref","is-referenced-by-count":17,"title":["Lightweight LCP Construction for Next-Generation Sequencing Datasets"],"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"}]},{"given":"Marinella","family":"Sciortino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"26_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":"26_CR2","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":"26_CR3","doi-asserted-by":"crossref","unstructured":"Bauer, M.J., Cox, A.J., Rosone, G.: Lightweight algorithms for constructing and inverting the bwt of string collections. Theor. Comput. Sci. (in press, 2012)","DOI":"10.1016\/j.tcs.2012.02.002"},{"key":"26_CR4","unstructured":"Beller, T., Gog, S., Ohlebusch, E., Schnattinger, T.: Computing the longest common prefix array based on the Burrows-Wheeler transform. Journal of Discrete Algorithms (to appear)"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-642-24583-1_20","volume-title":"String Processing and Information Retrieval","author":"T. Beller","year":"2011","unstructured":"Beller, T., Gog, S., Ohlebusch, E., Schnattinger, T.: Computing the Longest Common Prefix Array Based on the Burrows-Wheeler Transform. In: Grossi, R., Sebastiani, F., Silvestri, F. (eds.) SPIRE 2011. LNCS, vol.\u00a07024, pp. 197\u2013208. Springer, Heidelberg (2011)"},{"key":"26_CR6","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":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-642-22300-6_32","volume-title":"Algorithms and Data Structures","author":"J. Fischer","year":"2011","unstructured":"Fischer, J.: Inducing the LCP-Array. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol.\u00a06844, pp. 374\u2013385. Springer, Heidelberg (2011)"},{"key":"26_CR8","unstructured":"National\u00a0Center for Biotechnology\u00a0Information. Sequence Read Archive, \n                  \n                    http:\/\/trace.ncbi.nlm.nih.gov\/Traces\/sra\/sra.cgi?"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Gog, S., Ohlebusch, E.: Fast and Lightweight LCP-Array Construction Algorithms. In: ALENEX, pp. 25\u201334. SIAM (2011)","DOI":"10.1137\/1.9781611972917.3"},{"issue":"1","key":"26_CR10","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1186\/1471-2105-9-167","volume":"9","author":"J. Herold","year":"2008","unstructured":"Herold, J., Kurtz, S., Giegerich, R.: Efficient computation of absent words in genomic sequences. BMC Bioinformatics\u00a09(1), 167 (2008)","journal-title":"BMC Bioinformatics"},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-642-02441-2_17","volume-title":"Combinatorial Pattern Matching","author":"J. K\u00e4rkk\u00e4inen","year":"2009","unstructured":"K\u00e4rkk\u00e4inen, J., Manzini, G., Puglisi, S.J.: Permuted Longest-Common-Prefix Array. In: Kucherov, G., Ukkonen, E. (eds.) CPM 2009 Lille. LNCS, vol.\u00a05577, pp. 181\u2013192. Springer, Heidelberg (2009)"},{"issue":"3","key":"26_CR12","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":"26_CR13","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."},{"key":"26_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-642-16321-0_36","volume-title":"String Processing and Information Retrieval","author":"E. Ohlebusch","year":"2010","unstructured":"Ohlebusch, E., Gog, S., K\u00fcgel, A.: Computing Matching Statistics and Maximal Exact Matches on Compressed Full-Text Indexes. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol.\u00a06393, pp. 347\u2013358. Springer, Heidelberg (2010)"},{"key":"26_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-540-92182-0_14","volume-title":"Algorithms and Computation","author":"S. Puglisi","year":"2008","unstructured":"Puglisi, S., Turpin, A.: Space-Time Tradeoffs for Longest-Common-Prefix Array Computation. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 124\u2013135. Springer, Heidelberg (2008)"},{"issue":"4","key":"26_CR16","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/s00224-006-1198-x","volume":"41","author":"K. Sadakane","year":"2007","unstructured":"Sadakane, K.: Compressed suffix trees with full functionality. Theor. Comp. Sys.\u00a041(4), 589\u2013607 (2007)","journal-title":"Theor. Comp. Sys."},{"key":"26_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BFb0027775","volume-title":"Concurrency and Parallelism, Programming, Networking, and Security","author":"F. Shi","year":"1996","unstructured":"Shi, F.: Suffix Arrays for Multiple Strings: A Method for On-line Multiple String Searches. In: Jaffar, J., Yap, R.H.C. (eds.) ASIAN 1996. LNCS, vol.\u00a01179, pp. 11\u201322. Springer, Heidelberg (1996)"}],"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_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:56:00Z","timestamp":1620129360000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33122-0_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642331213","9783642331220"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33122-0_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}