{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:27:25Z","timestamp":1725467245481},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642389047"},{"type":"electronic","value":"9783642389054"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38905-4_20","type":"book-chapter","created":{"date-parts":[[2013,5,16]],"date-time":"2013-05-16T03:28:54Z","timestamp":1368674934000},"page":"201-210","source":"Crossref","is-referenced-by-count":11,"title":["External Memory Generalized Suffix and LCP Arrays Construction"],"prefix":"10.1007","author":[{"given":"Felipe A.","family":"Louza","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guilherme P.","family":"Telles","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cristina Dutra De Aguiar","family":"Ciferri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"20_CR1","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"Manber, U., Myers, E.W.: Suffix arrays: A new method for on-line string searches. SIAM J. Comput.\u00a022(5), 935\u2013948 (1993)","journal-title":"SIAM J. Comput."},{"key":"20_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on strings, trees, and sequences: computer science and computational biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge University Press, New York (1997)"},{"key":"20_CR3","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":"2","key":"20_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1242471.1242472","volume":"39","author":"S.J. Puglisi","year":"2007","unstructured":"Puglisi, S.J., Smyth, W.F., Turpin, A.H.: A taxonomy of suffix array construction algorithms. ACM Computing Surveys\u00a039(2), 1\u201331 (2007)","journal-title":"ACM Computing Surveys"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Nong, G., Zhang, S., Chan, W.H.: Linear suffix array construction by almost pure induced-sorting. In: Proc. Data Compression Conference, pp. 193\u2013202 (2009)","DOI":"10.1109\/DCC.2009.42"},{"key":"20_CR6","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":"20_CR7","doi-asserted-by":"crossref","unstructured":"Gog, S., Ohlebusch, E.: Fast and lightweight lcp-array construction algorithms. In: Proc. Meeting on Algorithm Engineering & Experiments, pp. 25\u201334 (2011)","DOI":"10.1137\/1.9781611972917.3"},{"issue":"1","key":"20_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-001-0051-5","volume":"32","author":"A. Crauser","year":"2002","unstructured":"Crauser, A., Ferragina, P.: A theoretical and experimental study on the construction of suffix arrays in external memory. Algorithmica\u00a032(1), 1\u201335 (2002)","journal-title":"Algorithmica"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Dementiev, R., K\u00e4rkk\u00e4inen, J., Mehnert, J., Sanders, P.: Better external memory suffix array construction. ACM J. of Experimental Algorithmics\u00a012 (2008)","DOI":"10.1145\/1227161.1402296"},{"issue":"3","key":"20_CR10","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/s00453-011-9535-0","volume":"63","author":"P. Ferragina","year":"2012","unstructured":"Ferragina, P., Gagie, T., Manzini, G.: Lightweight data indexing and compression in external memory. Algorithmica\u00a063(3), 707\u2013730 (2012)","journal-title":"Algorithmica"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Bingmann, T., Fischer, J., Osipov, V.: Inducing suffix and lcp arrays in external memory. In: Proc. Meeting on Algorithm Engineering & Experiments, pp. 88\u2013103 (2013)","DOI":"10.1137\/1.9781611972931.8"},{"key":"20_CR12","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)"},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1186\/1471-2105-10-137","volume":"10","author":"A. Pinho","year":"2009","unstructured":"Pinho, A., Ferreira, P., Garcia, S., Rodrigues, J.: On finding minimal absent words. BMC bioinformatics\u00a010, 137 (2009)","journal-title":"BMC bioinformatics"},{"issue":"4","key":"20_CR14","doi-asserted-by":"publisher","first-page":"806","DOI":"10.1007\/s00453-009-9369-1","volume":"60","author":"M. Arnold","year":"2011","unstructured":"Arnold, M., Ohlebusch, E.: Linear time algorithms for generalizations of the longest common substring problem. Algorithmica\u00a060(4), 806\u2013818 (2011)","journal-title":"Algorithmica"},{"key":"20_CR15","unstructured":"Burrows, M., Wheeler, D.: A block-sorting lossless data compression algorithm. Systems Research (1994)"},{"key":"20_CR16","volume-title":"Database System Implementation","author":"H. Garcia-Molina","year":"1999","unstructured":"Garcia-Molina, H., Widom, J., Ullman, J.D.: Database System Implementation. Prentice-Hall, Inc., Upper Saddle River (1999)"},{"issue":"1-2","key":"20_CR17","first-page":"649","volume":"236","author":"M. Barsky","year":"2008","unstructured":"Barsky, M., Stege, U., Thomo, A., Upton, C.: A new method for indexing genomes using on-disk suffix trees. Proc. ACM International Conference on Information and Knowledge Management\u00a0236(1-2), 649 (2008)","journal-title":"Proc. ACM International Conference on Information and Knowledge Management"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Sinha, R., Puglisi, S.J., Moffat, A., Turpin, A.: Improving suffix array locality for fast pattern matching on disk. Proc. ACM SIGMOD, 661\u2013672 (2008)","DOI":"10.1145\/1376616.1376683"},{"key":"20_CR19","doi-asserted-by":"publisher","first-page":"69","DOI":"10.2197\/ipsjdc.4.69","volume":"4","author":"W. Ng","year":"2008","unstructured":"Ng, W., Kakehi, K.: Merging string sequences by longest common prefixes. Information Processing Society of Japan Digital Courier\u00a04, 69\u201378 (2008)","journal-title":"Information Processing Society of Japan Digital Courier"},{"key":"20_CR20","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) (in press)","DOI":"10.1016\/j.tcs.2012.02.002"},{"key":"20_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-642-33122-0_26","volume-title":"Algorithms in Bioinformatics","author":"M.J. Bauer","year":"2012","unstructured":"Bauer, M.J., Cox, A.J., Rosone, G., Sciortino, M.: Lightweight LCP Construction for Next-Generation Sequencing Datasets. In: Raphael, B., Tang, J. (eds.) WABI 2012. LNCS, vol.\u00a07534, pp. 326\u2013337. Springer, Heidelberg (2012)"},{"issue":"1","key":"20_CR22","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.ejc.2012.07.011","volume":"34","author":"M. Crochemore","year":"2013","unstructured":"Crochemore, M., Ilie, L., Iliopoulos, C.S., Kubica, M., Rytter, W., Wale, T.: Computing the longest previous factor. European J. of Combinatorics\u00a034(1), 15\u201326 (2013)","journal-title":"European J. of Combinatorics"}],"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-38905-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T01:55:28Z","timestamp":1557712528000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38905-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642389047","9783642389054"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38905-4_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}