{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:06:17Z","timestamp":1740096377025,"version":"3.37.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319024318"},{"type":"electronic","value":"9783319024325"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-02432-5_18","type":"book-chapter","created":{"date-parts":[[2013,9,29]],"date-time":"2013-09-29T20:51:58Z","timestamp":1380487918000},"page":"141-152","source":"Crossref","is-referenced-by-count":1,"title":["Adding Compression and Blended Search to a Compact Two-Level Suffix Array"],"prefix":"10.1007","author":[{"given":"Simon","family":"Gog","sequence":"first","affiliation":[]},{"given":"Alistair","family":"Moffat","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"18_CR1","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1016\/0306-4379(96)00025-7","volume":"21","author":"R.A. Baeza-Yates","year":"1996","unstructured":"Baeza-Yates, R.A., Barbosa, E.F., Ziviani, N.: Hierarchies of indices for text searching. Inf. Systems\u00a021(6), 497\u2013514 (1996)","journal-title":"Inf. Systems"},{"issue":"5","key":"18_CR2","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0020-0190(96)00061-0","volume":"58","author":"L. Colussi","year":"1996","unstructured":"Colussi, L., De Col, A.: A time and space efficient data structure for string searching on large texts. Inf. Processing Letters\u00a058(5), 217\u2013222 (1996)","journal-title":"Inf. Processing Letters"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-31265-6_17","volume-title":"Combinatorial Pattern Matching","author":"M.P. Ferguson","year":"2012","unstructured":"Ferguson, M.P.: FEMTO: Fast search of large sequence collections. In: K\u00e4rkk\u00e4inen, J., Stoye, J. (eds.) CPM 2012. LNCS, vol.\u00a07354, pp. 208\u2013219. Springer, Heidelberg (2012)"},{"issue":"2","key":"18_CR4","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/301970.301973","volume":"46","author":"P. Ferragina","year":"1999","unstructured":"Ferragina, P., Grossi, R.: The string B-tree: A new data structure for search in external memory and its applications. J. ACM\u00a046(2), 236\u2013280 (1999)","journal-title":"J. ACM"},{"issue":"4","key":"18_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(4), 552\u2013581 (2005)","journal-title":"J. ACM"},{"key":"18_CR6","unstructured":"Gog, S., Moffat, A., Culpepper, J.S., Turpin, A., Wirth, A.: Large-scale pattern search using reduced-space on-disk suffix arrays. IEEE Trans. Knowledge and Data Engineering (to appear)"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Gog, S., Petri, M.: Optimized succinct data structures for massive data. Software Practice & Experience (to appear, 2013), \n                  \n                    http:\/\/dx.doi.org\/10.1002\/spe.2198","DOI":"10.1002\/spe.2198"},{"key":"18_CR8","first-page":"127","volume":"71","author":"R. Gonz\u00e1lez","year":"2009","unstructured":"Gonz\u00e1lez, R., Navarro, G.: A compressed text index on secondary memory. J. Combinatorial Mathematics and Combinatorial Comp.\u00a071, 127\u2013154 (2009)","journal-title":"J. Combinatorial Mathematics and Combinatorial Comp."},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/3-540-36574-5_7","volume-title":"Algorithms for Memory Hierarchies","author":"J. K\u00e4rkk\u00e4inen","year":"2003","unstructured":"K\u00e4rkk\u00e4inen, J., Rao, S.S.: Full-text indexes in external memory. In: Meyer, U., Sanders, P., Sibeyn, J.F. (eds.) Algorithms for Memory Hierarchies. LNCS, vol.\u00a02625, pp. 149\u2013170. Springer, Heidelberg (2003)"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/978-3-540-27801-6_32","volume-title":"Combinatorial Pattern Matching","author":"V. M\u00e4kinen","year":"2004","unstructured":"M\u00e4kinen, V., Navarro, G.: Compressed compact suffix arrays. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 420\u2013433. Springer, Heidelberg (2004)"},{"issue":"5","key":"18_CR11","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"Manber, U., Myers, G.W.: Suffix arrays: a new method for on-line string searches. SIAM J. Comp.\u00a022(5), 935\u2013948 (1993)","journal-title":"SIAM J. Comp."},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1007\/978-3-642-00887-0_63","volume-title":"Database Systems for Advanced Applications","author":"A. Moffat","year":"2009","unstructured":"Moffat, A., Puglisi, S.J., Sinha, R.: Reducing space requirements for disk resident suffix arrays. In: Zhou, X., Yokota, H., Deng, K., Liu, Q. (eds.) DASFAA 2009. LNCS, vol.\u00a05463, pp. 730\u2013744. Springer, Heidelberg (2009)"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Sinha, R., Puglisi, S.J., Moffat, A., Turpin, A.: Improving suffix array locality for fast pattern matching on disk. In: Wang, J.T.-L. (ed.) Proc. ACM SIGMOD Int. Conf. Management of Data, pp. 661\u2013672 (2008)","DOI":"10.1145\/1376616.1376683"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-02432-5_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T12:50:24Z","timestamp":1558097424000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-02432-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319024318","9783319024325"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-02432-5_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}