| 1 |
Weighted Ancestors in Suffix Trees Revisited ...
|
|
|
|
Abstract:
The weighted ancestor problem is a well-known generalization of the predecessor problem to trees. It is known to require $Ω(\log\log n)$ time for queries provided $O(n\mathop{\mathrm{polylog}} n)$ space is available and weights are from $[0..n]$, where $n$ is the number of tree nodes. However, when applied to suffix trees, the problem, surprisingly, admits an $O(n)$-space solution with constant query time, as was shown by Gawrychowski, Lewenstein, and Nicholson (Proc. ESA 2014). This variant of the problem can be reformulated as follows: given the suffix tree of a string $s$, we need a data structure that can locate in the tree any substring $s[p..q]$ of $s$ in $O(1)$ time (as if one descended from the root reading $s[p..q]$ along the way). Unfortunately, the data structure of Gawrychowski et al. has no efficient construction algorithm, limiting its wider usage as an algorithmic tool. In this paper we resolve this issue, describing a data structure for weighted ancestors in suffix trees with constant query ... : 15 pages, 5 figures ...
|
|
Keyword:
Data Structures and Algorithms cs.DS; FOS Computer and information sciences
|
|
URL: https://arxiv.org/abs/2103.00462
https://dx.doi.org/10.48550/arxiv.2103.00462
|
|
BASE
|
|
Hide details
|
|
|
| 3 |
Tight Upper and Lower Bounds on Suffix Tree Breadth
|
|
|
|
In: Accepted Version (2021)
|
|
BASE
|
|
Show details
|
|
|
| 8 |
Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction
|
|
Tanimura, Yuka; I, Tomohiro; Bannai, Hideo. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. : LIPIcs - Leibniz International Proceedings in Informatics. 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), 2016
|
|
BASE
|
|
Show details
|
|
|
| 10 |
Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction ...
|
|
|
|
BASE
|
|
Show details
|
|
|
| 11 |
Deterministic sub-linear space LCE data structures with efficient construction ...
|
|
|
|
BASE
|
|
Show details
|
|
|
|
|
