{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:26:53Z","timestamp":1759336013609},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223412"},{"type":"electronic","value":"9783540278016"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27801-6_34","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T23:00:15Z","timestamp":1283727615000},"page":"445-456","source":"Crossref","is-referenced-by-count":14,"title":["Compressed Index for a Dynamic Collection of Texts"],"prefix":"10.1007","author":[{"given":"Ho-Leung","family":"Chan","sequence":"first","affiliation":[]},{"given":"Wing-Kai","family":"Hon","sequence":"additional","affiliation":[]},{"given":"Tak-Wah","family":"Lam","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","unstructured":"Burrows, M., Wheeler, D.J.: A Block-sorting Lossless Data Compression Algorithm. Technical Report 124, Digital Equipment Corporation, Paolo Alto, California (1994)"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Manzini, G.: Opportunistic Data Structures with Applications. In: Proceedings of Symposium on Foundations of Computer Science, pp. 390\u2013398 (2000)","DOI":"10.1109\/SFCS.2000.892127"},{"key":"34_CR3","unstructured":"The Google Homepage Search Engine, http:\/\/www.google.com\/"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Grossi, R., Vitter, J.S.: Compressed Suffix Arrays and Suffix Tree with Applications to Text Indexing and String Matching. In: Proceedings of Symposium on Theory of Computing, pp. 397\u2013406 (2000)","DOI":"10.1145\/335305.335351"},{"key":"34_CR5","unstructured":"Hon, W.K., Lam, T.W., Sung, W.K., Tse, W.L., Wong, C.K., Yiu, S.M.: Practical Aspects of Compressed Suffix Arrays and FM-index in Searching DNA Sequences. To appear in Proceedings of Workshop on Algorithm Engineering and Experiments (2004)"},{"issue":"13","key":"34_CR6","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"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Lam, T.W., Sadakane, K., Sung, W.K., Yiu, S.M.: A Space and Time Efficient Algorithm for Constructing Compressed Suffix Array. In: Proceedings of International Conference on Computing and Combinatorics, pp. 401\u2013410 (2002)","DOI":"10.1007\/3-540-45655-4_43"},{"issue":"5","key":"34_CR8","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"},{"issue":"2","key":"34_CR9","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 Algorithm. Journal of the ACM\u00a023(2), 262\u2013272 (1976)","journal-title":"Journal of the ACM"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"Mewes, H.W., Heumann, K.: Genome Analysis: Pattern Search in Biological Macromolecules. In: Proceedings of Symposium on Combinatorial Pattern Matching, pp. 261\u2013285 (1995)","DOI":"10.1007\/3-540-60044-2_48"},{"key":"34_CR11","series-title":"Lecture Notes in Computer Science","first-page":"34","volume-title":"The Design of Dynamic Data Structures","author":"M.H. Overmars","year":"1983","unstructured":"Overmars, M.H.: The Design of Dynamic Data Structures. LNCS, vol.\u00a0156, pp. 34\u201335. Springer, Heidelberg (1983)"},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"Sadakane, K.: Compressed Text Databases with Efficient Query Algorithms based on Compressed Suffix Array. In: Proceedings of International Symposium on Algorithms and Computation, pp. 410\u2013421 (2000)","DOI":"10.1007\/3-540-40996-3_35"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear Pattern Matching Algorithm. In: Proceedings of Symposium on Switching and Automata Theory, pp. 1\u201311 (1973)","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27801-6_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:21:30Z","timestamp":1605759690000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27801-6_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223412","9783540278016"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27801-6_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}