{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:18:11Z","timestamp":1725491891329},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540755296"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75530-2_17","type":"book-chapter","created":{"date-parts":[[2007,9,19]],"date-time":"2007-09-19T14:26:50Z","timestamp":1190212010000},"page":"184-194","source":"Crossref","is-referenced-by-count":9,"title":["Optimal Self-adjusting Trees for Dynamic String Data in Secondary Storage"],"prefix":"10.1007","author":[{"given":"Pang","family":"Ko","sequence":"first","affiliation":[]},{"given":"Srinivas","family":"Aluru","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/11780441_4","volume-title":"Combinatorial Pattern Matching","author":"J. Barbay","year":"2006","unstructured":"Barbay, J., Golynski, A., Munro, J.I., Rao, S.S.: Adaptive searching in succinctly encoded binary relations and tree-structured documents. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol.\u00a04009, pp. 24\u201335. Springer, Heidelberg (2006)"},{"key":"17_CR2","first-page":"29","volume-title":"Proc. 12th IEEE International Conference on High Performance Computing","author":"S. Bedathur","year":"2005","unstructured":"Bedathur, S., Haritsa, J.: Search-optimized suffix-tree storage for biological applications. In: Proc. 12th IEEE International Conference on High Performance Computing, pp. 29\u201339. IEEE Computer Society Press, Los Alamitos (2005)"},{"issue":"4","key":"17_CR3","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1002\/spe.4380230403","volume":"23","author":"J. Bell","year":"1993","unstructured":"Bell, J., l Gupta, G.: An evaluation of self-adjusting binary search tree techniques. Software - Practice and Experience\u00a023(4), 369\u2013382 (1993)","journal-title":"Software - Practice and Experience"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1145\/1109557.1109621","volume-title":"Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"G.S. Brodal","year":"2006","unstructured":"Brodal, G.S., Fagerberg, R.: Cache-oblivious string dictionaries. In: Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 581\u2013590. ACM Press, New York (2006)"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Ciriani, V., Ferragina, P., Luccio, F., Muthukrishnan, S.: Static optimality theorem for external memory string access. In: Proc. 43rd Annual Symposium on Foundations of Computer Science, pp. 219\u2013227 (2002)","DOI":"10.1109\/SFCS.2002.1181945"},{"key":"17_CR6","first-page":"383","volume-title":"Proc. 7th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"D.R. Clark","year":"1996","unstructured":"Clark, D.R., Munro, J.I.: Efficient suffix trees on secondary storage. In: Proc. 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 383\u2013391. ACM Press, New York (1996)"},{"issue":"6","key":"17_CR7","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":"17_CR8","first-page":"397","volume-title":"Proc. 32nd Annual ACM Symposium on Theory of Computing","author":"R. Grossi","year":"2000","unstructured":"Grossi, R., Vitter, J.S.: Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In: Proc. 32nd Annual ACM Symposium on Theory of Computing, pp. 397\u2013406. ACM Press, New York (2000)"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/11780441_8","volume-title":"Combinatorial Pattern Matching","author":"P. Ko","year":"2006","unstructured":"Ko, P., Aluru, S.: Obtaining provably good performance from suffix trees in secondary storage. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol.\u00a04009, pp. 72\u201383. Springer, Heidelberg (2006)"},{"issue":"13","key":"17_CR10","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1002\/(SICI)1097-024X(199911)29:13<1149::AID-SPE274>3.0.CO;2-O","volume":"29","author":"S. Kurtz","year":"1999","unstructured":"Kurtz, S.: Reducing the space requirement of suffix trees. Software - Practice and Experience\u00a029(13), 1149\u20131171 (1999)","journal-title":"Software - Practice and Experience"},{"issue":"2","key":"17_CR11","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1006\/jagm.2000.1151","volume":"39","author":"J.I. Munro","year":"2001","unstructured":"Munro, J.I., Raman, V., Rao, S.S.: Space efficient suffix trees. J. Algorithms\u00a039(2), 205\u2013222 (2001)","journal-title":"J. Algorithms"},{"issue":"3","key":"17_CR12","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"D.D. Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Self-adjusting binary search trees. Journal of the ACM\u00a032(3), 652\u2013686 (1985)","journal-title":"Journal of the ACM"},{"issue":"10","key":"17_CR13","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1002\/spe.394","volume":"31","author":"H.E. Williams","year":"2001","unstructured":"Williams, H.E., Zobel, J., Heinz, S.: Self-adjusting trees in practice for large text collections. Software - Practice and Experience\u00a031(10), 925\u2013939 (2001)","journal-title":"Software - Practice and Experience"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75530-2_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:23:17Z","timestamp":1619518997000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75530-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540755296"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75530-2_17","relation":{},"subject":[]}}