Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
Compressed representations of sequences and full-text indexes
ACM Transactions on Algorithms (TALG)
Dynamic extended suffix arrays
Journal of Discrete Algorithms
| Hi-index | 0.00 |
This paper investigates how to index a text which is subject to updates. Thebest solution in the literature is based on suffix tree using O(n log n) bits ofstorage, where n is the length of the text. It supports finding all occurrences ofa pattern P in O(|P| + occ) time, where occ is the number of occurrences.Eachtext update consists of inserting or deleting a substring of length y and can besupported in O(y + \sqrt n) time. In this paper, we initiate the study of compressedindex using only O(n log |\Sigma|) bits of space, where \Sigma denotes the alphabet. Oursolution supports finding all occurrences of a pattern P in O(|P| log2 n(log\epsilon n + log |\Sigma|) + occlog1+\epsilon n) time, while insertion or deletion of a substring of length y can be done inO((y + \sqrt n) log2+\epsilon n) amortized time, where0 \lt \epsilon \le 1.The corepart of our data structure is based on the recent work on Compressed Suffix Trees(CST) and Compressed Suffix Arrays (CSA).