icalp13.pdf (370.2 kB)
Download file

Dynamic Compressed Strings with Random Access

Download (370.2 kB)
conference contribution
posted on 04.10.2013, 12:14 by Roberto Grossi, Rajeev Raman, Satti Srinivasa Rao, Rossano Venturini
We consider the problem of storing a string S in dynamic compressed form, while permitting operations directly on the compressed representation of S: access a substring of S; replace, insert or delete a symbol in S; count how many occurrences of a given symbol appear in any given prefix of S (called rank operation) and locate the position of the ith occurrence of a symbol inside S (called select operation). We discuss the time complexity of several combinations of these operations along with the entropy space bounds of the corresponding compressed indexes. In this way, we extend or improve the bounds of previous work by Ferragina and Venturini [TCS, 2007], Jansson et al. [ICALP, 2012], and Nekrich and Navarro [SODA, 2013].

History

Citation

Grossi, R.; Raman, R. et al. ‘Dynamic Compressed Strings with Random Access’ in Fomin, F.V.; Freivalds, R. et al. (Eds.) Automata, Languages, and Programming - Proceedings of the 40th International Colloquium, ICALP 2013, Part 1 (2013 Springer-Verlag Berlin Heidelberg), pp. 504-515.

Author affiliation

/Organisation/COLLEGE OF SCIENCE AND ENGINEERING/Department of Computer Science

Source

40th International Colloquium, ICALP 2013, Riga, Latvia

Version

AM (Accepted Manuscript)

Published in

Grossi

Publisher

Springer Berlin Heidelberg

issn

0302-9743

eissn

1611-3349

isbn

978-3-642-39205-4;978-3-642-39206-1

Copyright date

2013

Available date

01/07/2014

Publisher version

http://link.springer.com/chapter/10.1007/978-3-642-39206-1_43

Book series

Lecture Notes in Computer Science;7965

Temporal coverage: start date

08/07/2013

Temporal coverage: end date

12/07/2013

Language

en

Usage metrics

Categories

Keywords

Exports