{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:09:59Z","timestamp":1725574199723},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540653844"},{"type":"electronic","value":"9783540493822"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/978-3-540-49382-2_17","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T23:37:34Z","timestamp":1294443454000},"page":"186-196","source":"Crossref","is-referenced-by-count":4,"title":["Space Efficient Suffix Trees"],"prefix":"10.1007","author":[{"given":"Ian","family":"Munro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. Srinivasa","family":"Rao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/0022-0000(85)90060-1","volume":"31","author":"A. Apostolico","year":"1985","unstructured":"Apostolico, A., Preparata, F.P.: Structural properties of the string statistics problem. Journal of Computer and System Sciences\u00a031, 394\u2013411 (1985)","journal-title":"Journal of Computer and System Sciences"},{"issue":"5","key":"17_CR2","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/360762.360766","volume":"18","author":"A.F. Cardenas","year":"1975","unstructured":"Cardenas, A.F.: Analysis and performance of inverted data base structures. Communications of The ACM\u00a018(5), 253\u2013263 (1975)","journal-title":"Communications of The ACM"},{"key":"17_CR3","unstructured":"Clark, D.R., Munro, J.I.: Efficient Suffix Trees on Secondary Storage. In: Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms, pp. 383\u2013391 (1996)"},{"issue":"1","key":"17_CR4","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1093\/nar\/14.1.141","volume":"4","author":"B. Clift","year":"1986","unstructured":"Clift, B., Haussler, D., McConnel, R., Schneider, T.D., Stormo, G.D.: Sequence landscapes. Nucleic Acids Research\u00a04(1), 141\u2013158 (1986)","journal-title":"Nucleic Acids Research"},{"key":"17_CR5","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. Information Processing Letters\u00a058, 217\u2013222 (1996)","journal-title":"Information Processing Letters"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Fraser, C., Wendt, A., Myers, E.W.: Analysing and compressing assembly code. In: Proceedings of the SIGPLAN Symposium on Compiler Construction (1984)","DOI":"10.1145\/502874.502886"},{"key":"17_CR7","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. (eds.) Information Retrieval: Data Structures and Algorithms, pp. 66\u201382. Prentice-Hall, Englewood Cliffs (1992)"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Jacobson, G.: Space-efficient Static Trees and Graphs. In: Proceedings of the IEEE Symposium on Foundations of Computer Science, pp. 549\u2013554 (1989)","DOI":"10.1109\/SFCS.1989.63533"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/3-540-61332-3_155","volume-title":"Computing and Combinatorics","author":"J. K\u00e4rkk\u00e4inen","year":"1996","unstructured":"K\u00e4rkk\u00e4inen, J., Ukkonen, E.: Sparse suffix trees. In: Cai, J.-Y., Wong, C.K. (eds.) COCOON 1996. LNCS, vol.\u00a01090, pp. 219\u2013230. Springer, Heidelberg (1996)"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Landau, G.M., Vishkin, U.: Introducing efficient parallelism into approximate string matching. In: Proc. 18th ACM Symposium on Theory of Computing, pp. 220\u2013230 (1986)","DOI":"10.1145\/12130.12152"},{"issue":"5","key":"17_CR11","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"Manber, U., Myers, G.: Suffix Arrays: A New Method for On-line String Searches. SIAM Journal on Computing\u00a022(5), 935\u2013948 (1993)","journal-title":"SIAM Journal on Computing"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"M.E. McCreight","year":"1976","unstructured":"McCreight, M.E.: A space-economical suffix tree construction algorithm. Journal of the ACM\u00a023, 262\u2013272 (1976)","journal-title":"Journal of the ACM"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/321479.321481","volume":"15","author":"D.R. Morrison","year":"1968","unstructured":"Morrison, D.R.: PATRICIA: Practical Algorithm To Retrieve Information Coded In Alphanumeric. Journal of the ACM\u00a015, 514\u2013534 (1968)","journal-title":"Journal of the ACM"},{"key":"17_CR14","unstructured":"Munro, J.I., Benoit, D.: Succinct Representation of k-ary trees. Manuscript"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/3-540-62034-6_35","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"J.I. Munro","year":"1996","unstructured":"Munro, J.I.: Tables. In: Chandru, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol.\u00a01180, pp. 37\u201342. Springer, Heidelberg (1996)"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Munro, J.I., Raman, V.: Succinct representation of balanced parentheses, static trees and planar graphs. In: Proceedings of the IEEE Symposium on Foundations of Computer Science, pp. 118\u2013126 (1997)","DOI":"10.1109\/SFCS.1997.646100"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Muthukrishnan, S.: Randomization in Stringology. In: Proceedings of the Preconference Workshop on Randomization, Kharagpur, India (December 1997)","DOI":"10.1007\/3-540-64359-1_707"},{"issue":"1","key":"17_CR18","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/322234.322237","volume":"28","author":"M. Rodeh","year":"1991","unstructured":"Rodeh, M., Pratt, V.R., Even, S.: Linear algorithm for data compression via string matching. Journal of the ACM\u00a028(1), 16\u201324 (1991)","journal-title":"Journal of the ACM"},{"key":"17_CR19","unstructured":"Shang, H.: Trie methods for text and spatial data structures on secondary storage, PhD Thesis, McGill University (1995)"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern matching algorithm. In: Proc. 14th IEEE Symposium on Switching and Automata Theory, pp. 1\u201311 (1973)","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-49382-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T14:06:56Z","timestamp":1559916416000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-49382-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540653844","9783540493822"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-49382-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}