{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:37:02Z","timestamp":1725550622917},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540297406"},{"type":"electronic","value":"9783540322412"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11575832_8","type":"book-chapter","created":{"date-parts":[[2005,10,13]],"date-time":"2005-10-13T14:12:50Z","timestamp":1129212770000},"page":"55-66","source":"Crossref","is-referenced-by-count":2,"title":["Counting Suffix Arrays and Strings"],"prefix":"10.1007","author":[{"given":"Klaus-Bernd","family":"Sch\u00fcrmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens","family":"Stoye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_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 Journal on Computing\u00a022, 935\u2013948 (1993)","journal-title":"SIAM Journal on Computing"},{"key":"8_CR2","first-page":"66","volume-title":"Information retrieval: data structures and algorithms","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. In: Frakes, W.B., Baeza-Yates, R.A. (eds.) Information retrieval: data structures and algorithms, pp. 66\u201382. Prentice-Hall, Englewood Cliffs (1992)"},{"key":"8_CR3","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, 53\u201386 (2004)","journal-title":"Journal of Discrete Algorithms"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-540-45138-9_15","volume-title":"Mathematical Foundations of Computer Science 2003","author":"H. Bannai","year":"2003","unstructured":"Bannai, H., Inenaga, S., Shinohara, A., Takeda, M.: Inferring strings from graphs and arrays. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 208\u2013217. Springer, Heidelberg (2003)"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-44888-8_5","volume-title":"Combinatorial Pattern Matching","author":"S. Burkhardt","year":"2003","unstructured":"Burkhardt, S., K\u00e4rkk\u00e4inen, J.: Fast lightweight suffix array construction and checking. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 55\u201369. Springer, Heidelberg (2003)"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1051\/ita:2002012","volume":"36","author":"J.P. Duval","year":"2002","unstructured":"Duval, J.P., Lefebvre, A.: Words over an ordered alphabet and suffix permutations. RAIRO \u2013 Theoretical Informatics and Applications\u00a036, 249\u2013259 (2002)","journal-title":"RAIRO \u2013 Theoretical Informatics and Applications"},{"unstructured":"Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm. Technical Report 124, Digital System Research Center (1994)","key":"8_CR7"},{"doi-asserted-by":"crossref","unstructured":"Grossi, R., Vitter, J.S.: Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC 2000), pp. 397\u2013406 (2000)","key":"8_CR8","DOI":"10.1145\/335305.335351"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1109\/SFCS.2000.892127","volume-title":"Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS 2000)","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 (FOCS 2000), pp. 390\u2013398. IEEE Computer Society, Los Alamitos (2000)"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/3-540-40996-3_35","volume-title":"Algorithms and Computation","author":"K. Sadakane","year":"2000","unstructured":"Sadakane, K.: Compressed text databases with efficient query algorithms based on the compressed suffix array. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol.\u00a01969, pp. 410\u2013421. Springer, Heidelberg (2000)"},{"key":"8_CR11","first-page":"23","volume-title":"Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005)","author":"M. He","year":"2005","unstructured":"He, M., Munro, J.I., Rao, S.S.: A categorization theorem on suffix arrays with applications to space efficient text indexes. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), pp. 23\u201332. SIAM, Philadelphia (2005)"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/S0196-6774(03)00043-9","volume":"48","author":"E.D. Demaine","year":"2003","unstructured":"Demaine, E.D., L\u00f3pez-Ortiz, A.: A linear lower bound on index size for text retrieval. Journal of Algorithms\u00a048, 2\u201315 (2003)","journal-title":"Journal of Algorithms"},{"key":"8_CR13","first-page":"11","volume-title":"Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005)","author":"P.B. Miltersen","year":"2005","unstructured":"Miltersen, P.B.: Lower bounds on the size of selection and rank indexes. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), pp. 11\u201312. SIAM, Philadelphia (2005)"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/j.tcs.2004.11.014","volume":"332","author":"M. Crochemore","year":"2005","unstructured":"Crochemore, M., D\u00e9sarm\u00e9nien, J., Perrin, D.: A note on the Burrows-Wheeler transformation. Theoretical Computer Science\u00a0332, 567\u2013572 (2005)","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Sch\u00fcrmann, K.B., Stoye, J.: Counting suffix arrays and strings. Technical Report 2005-04, Technische Fakult\u00e4t, Universit\u00e4t Bielefeld, Germany (2005)","key":"8_CR15","DOI":"10.1007\/11575832_8"},{"key":"8_CR16","volume-title":"Concrete Mathematics","author":"R.L. Graham","year":"1994","unstructured":"Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics, 2nd edn. Addison-Wesley, Reading (1994)","edition":"2"},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00009247","volume":"23","author":"D. Moore","year":"1999","unstructured":"Moore, D., Smyth, W.F., Miller, D.: Counting distinct strings. Algorithmica\u00a023, 1\u201313 (1999)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11575832_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:58:08Z","timestamp":1605643088000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11575832_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540297406","9783540322412"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11575832_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}