{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:12:20Z","timestamp":1743012740377,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642008863"},{"type":"electronic","value":"9783642008870"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-00887-0_63","type":"book-chapter","created":{"date-parts":[[2009,3,19]],"date-time":"2009-03-19T09:49:36Z","timestamp":1237456176000},"page":"730-744","source":"Crossref","is-referenced-by-count":6,"title":["Reducing Space Requirements for Disk Resident Suffix Arrays"],"prefix":"10.1007","author":[{"given":"Alistair","family":"Moffat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon J.","family":"Puglisi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ranjan","family":"Sinha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"63_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"},{"issue":"1","key":"63_CR2","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1023\/B:INRT.0000048490.99518.5c","volume":"8","author":"V.N. Anh","year":"2005","unstructured":"Anh, V.N., Moffat, A.: Inverted index compression using word-aligned binary codes. Information Retrieval\u00a08(1), 151\u2013166 (2005)","journal-title":"Information Retrieval"},{"key":"63_CR3","series-title":"NATO ASI Series F12","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-642-82456-2_6","volume-title":"Combinatorial Algorithms on Words","author":"A. Apostolico","year":"1985","unstructured":"Apostolico, A.: The myriad virtues of subword trees. In: Apostolico, A., Galil, Z. (eds.) Combinatorial Algorithms on Words. NATO ASI Series F12, pp. 85\u201396. Springer, Berlin (1985)"},{"issue":"6","key":"63_CR4","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. Information Systems\u00a021(6), 497\u2013514 (1996)","journal-title":"Information Systems"},{"key":"63_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-540-39984-1_10","volume-title":"String Processing and Information Retrieval","author":"N.R. Brisaboa","year":"2003","unstructured":"Brisaboa, N.R., Fari\u00f1a, A., Navarro, G., Esteller, M.F. (S,C)-dense coding: An optimized compression code for natural language text databases. In: Nascimento, M.A., de Moura, E.S., Oliveira, A.L. (eds.) SPIRE 2003. LNCS, vol.\u00a02857, pp. 122\u2013136. Springer, Heidelberg (2003)"},{"issue":"1","key":"63_CR6","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1109\/TKDE.2005.3","volume":"17","author":"C.-F. Cheung","year":"2005","unstructured":"Cheung, C.-F., Xu Yu, J., Lu, H.: Constructing suffix tree for gigabyte sequences with megabyte memory. IEEE Transactions on Knowledge and Data Engineering\u00a017(1), 90\u2013105 (2005)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"63_CR7","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\u201335 (2002)","journal-title":"Algorithmica"},{"key":"63_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11575832_1","volume-title":"String Processing and Information Retrieval","author":"J.S. Culpepper","year":"2005","unstructured":"Culpepper, J.S., Moffat, A.: Enhanced byte codes with restricted prefix properties. In: Consens, M.P., Navarro, G. (eds.) SPIRE 2005. LNCS, vol.\u00a03772, pp. 1\u201312. Springer, Heidelberg (2005)"},{"issue":"3.4","key":"63_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1227161.1402296","volume":"12","author":"R. Dementiev","year":"2008","unstructured":"Dementiev, R., K\u00e4rkk\u00e4inen, J., Mehnert, J., Sanders, P.: Better external memory suffix array construction. ACM Journal of Experimental Algorithmics\u00a012(3.4), 1\u201324 (2008)","journal-title":"ACM Journal of Experimental Algorithmics"},{"issue":"6","key":"63_CR10","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1145\/355541.355547","volume":"47","author":"M. Farach-Colton","year":"2000","unstructured":"Farach-Colton, M., Ferragina, P., Muthukrishnan, S.: On the sorting-complexity of suffix tree construction. Journal of the ACM\u00a047(6), 987\u20131011 (2000)","journal-title":"Journal of the ACM"},{"key":"63_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-540-73437-6_23","volume-title":"Combinatorial Pattern Matching","author":"R. Gonz\u00e1lez","year":"2007","unstructured":"Gonz\u00e1lez, R., Navarro, G.: Compressed text indexes with fast locate. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol.\u00a04580, pp. 216\u2013227. Springer, Heidelberg (2007)"},{"key":"63_CR12","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, Cambridge (1997)"},{"key":"63_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/3-540-48194-X_17","volume-title":"Combinatorial Pattern Matching","author":"T. Kasai","year":"2001","unstructured":"Kasai, T., Lee, G.H., Arimura, H., Arikawa, S., Park, K.: Linear-time longest-common-prefix computation in suffix arrays and its applications. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol.\u00a02089, pp. 181\u2013192. Springer, Heidelberg (2001)"},{"issue":"11","key":"63_CR14","doi-asserted-by":"publisher","first-page":"1722","DOI":"10.1109\/5.892708","volume":"88","author":"J. Larsson","year":"2000","unstructured":"Larsson, J., Moffat, A.: Off-line dictionary-based compression. Proceedings of the IEEE\u00a088(11), 1722\u20131732 (2000)","journal-title":"Proceedings of the IEEE"},{"issue":"5","key":"63_CR15","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 Journal of Computing\u00a022(5), 935\u2013948 (1993)","journal-title":"SIAM Journal of Computing"},{"key":"63_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-540-27810-8_32","volume-title":"Algorithm Theory - SWAT 2004","author":"G. Manzini","year":"2004","unstructured":"Manzini, G.: Two space saving tricks for linear time LCP array computation. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol.\u00a03111, pp. 372\u2013383. Springer, Heidelberg (2004)"},{"issue":"2","key":"63_CR17","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E.M. McCreight","year":"1976","unstructured":"McCreight, E.M.: A space-economical suffix tree construction algroithm. Journal of the ACM\u00a023(2), 262\u2013272 (1976)","journal-title":"Journal of the ACM"},{"key":"63_CR18","doi-asserted-by":"crossref","unstructured":"Navarro, G., M\u00e4kinen, V.: Compressed full text indexes. ACM Computing Surveys\u00a039(1) (2007)","DOI":"10.1145\/1216370.1216372"},{"key":"63_CR19","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1145\/1247480.1247572","volume-title":"Proceedings of the 2007 ACM SIGMOD International Conference on Management of Data","author":"B. Phoophakdee","year":"2007","unstructured":"Phoophakdee, B., Zaki, M.J.: Genome-scale disk-based suffix tree indexing. In: Chan, C.Y., Ooi, B.C., Zhou, A. (eds.) Proceedings of the 2007 ACM SIGMOD International Conference on Management of Data, pp. 833\u2013844. ACM, New York (2007)"},{"key":"63_CR20","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1145\/1376616.1376683","volume-title":"Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data","author":"R. Sinha","year":"2008","unstructured":"Sinha, R., Puglisi, S.J., Moffat, A., Turpin, A.: Improving suffix array locality for fast pattern matching on disk. In: Lakshmanan, L.V.S., Ng, R.T., Shasha, D. (eds.) Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pp. 661\u2013672. ACM, New York (2008)"},{"key":"63_CR21","volume-title":"Computing Patterns in Strings","author":"B. Smyth","year":"2003","unstructured":"Smyth, B.: Computing Patterns in Strings. Pearson Addison-Wesley, Essex (2003)"},{"issue":"3","key":"63_CR22","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s00778-005-0154-8","volume":"14","author":"Y. Tian","year":"2005","unstructured":"Tian, Y., Tata, S., Hankins, R.A., Patel, J.M.: Practical methods for constructing suffix trees. The VLDB Journal\u00a014(3), 281\u2013299 (2005)","journal-title":"The VLDB Journal"},{"issue":"3","key":"63_CR23","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E. Ukkonen","year":"1995","unstructured":"Ukkonen, E.: Online construction of suffix trees. Algorithmica\u00a014(3), 249\u2013260 (1995)","journal-title":"Algorithmica"},{"key":"63_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/SWAT.1973.13","volume-title":"Proceedings of the 14th Annual Symposium on Switching and Automata Theory","author":"P. Weiner","year":"1973","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: Proceedings of the 14th Annual Symposium on Switching and Automata Theory, pp. 1\u201311. IEEE Computer Society, Washington (1973)"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00887-0_63","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:53:44Z","timestamp":1558266824000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00887-0_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642008863","9783642008870"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00887-0_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}