Advertisement
Published in:
2007 | OriginalPaper | Chapter
Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts
(Extended Abstract)
Authors : Sunho Lee, Kunsoo Park
Published in: Combinatorial Pattern Matching
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Given an
n
-length text over a
σ
-size alphabet, we propose a dynamic rank-select structure that supports
$O((1+\frac{\log\sigma}{\log\log n})\log n)$
time operations in
n
log
σ
+
o
(
n
log
σ
) bits space. If
σ
< log
n
, then the operation time is
O
(log
n
). In addition, we consider both static and dynamic rank-select structures on the run-length encoding (RLE) of a text. For an
n
′-length RLE of an
n
-length text, we present a static structure that gives
O
(1) time
select
and
O
(loglog
σ
) time
rank
using
n
′log
σ
+
O
(
n
) bits and a dynamic structure that provides
$O((1+\frac{\log\sigma}{\log\log n})\log n)$
time operations in
n
′log
σ
+
o
(
n
′log
σ
) +
O
(
n
) bits.