Abstract
Let T be a string with n characters over an alphabet of bounded size. The recent breakthrough on compressed indexing allows us to build an index for T in optimal space (i.e., O(n) bits), while supporting very efficient pattern matching [2,4]. This paper extends the work on optimal-space indexing to a dynamic collection of texts. Precisely, we give a compressed index using O(n) bits where n is the total length of texts, such that searching for a pattern P takes O(|P|log n + occ log2 n) time where occ is the number of occurrences, and inserting or deleting a text T takes O(|T|log n) time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Burrows, M., Wheeler, D.J.: A Block-sorting Lossless Data Compression Algorithm. Technical Report 124, Digital Equipment Corporation, Paolo Alto, California (1994)
Ferragina, P., Manzini, G.: Opportunistic Data Structures with Applications. In: Proceedings of Symposium on Foundations of Computer Science, pp. 390–398 (2000)
The Google Homepage Search Engine, http://www.google.com/
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–406 (2000)
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)
Kurtz, S.: Reducing the Space Requirement of Suffix Trees. Software Practice and Experience 29(13), 1149–1171 (1999)
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–410 (2002)
Manber, U., Myers, G.: Suffix Arrays: A New Method for On-Line String Searches. SIAM Journal on Computing 22(5), 935–948 (1993)
McCreight, E.M.: A Space-economical Suffix Tree Construction Algorithm. Journal of the ACM 23(2), 262–272 (1976)
Mewes, H.W., Heumann, K.: Genome Analysis: Pattern Search in Biological Macromolecules. In: Proceedings of Symposium on Combinatorial Pattern Matching, pp. 261–285 (1995)
Overmars, M.H.: The Design of Dynamic Data Structures. LNCS, vol. 156, pp. 34–35. Springer, Heidelberg (1983)
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–421 (2000)
Weiner, P.: Linear Pattern Matching Algorithm. In: Proceedings of Symposium on Switching and Automata Theory, pp. 1–11 (1973)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chan, HL., Hon, WK., Lam, TW. (2004). Compressed Index for a Dynamic Collection of Texts. In: Sahinalp, S.C., Muthukrishnan, S., Dogrusoz, U. (eds) Combinatorial Pattern Matching. CPM 2004. Lecture Notes in Computer Science, vol 3109. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27801-6_34
Download citation
DOI: https://doi.org/10.1007/978-3-540-27801-6_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22341-2
Online ISBN: 978-3-540-27801-6
eBook Packages: Springer Book Archive