arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2302.01373cs.DS
收藏

最优最重诱导祖先

Optimal Heaviest Induced Ancestors

Panagiotis Charalampopoulos, Bartłomiej Dudek, Paweł Gawrychowski, Karol Pokorski

摘要:

我们重新讨论了Gagie,Gawrychowski和Nekrich [CCCG 2013]引入的最重诱导祖先(HIA)问题,该问题在字符串算法中有许多应用。假设$T_1$和$T_2$是两个根树,其节点的权重在所有根到叶的路径中都是增加的,并且叶子上有标签,使得树的两个叶子没有相同的标签。一对节点$(u, v)\in T_1 \times T_2$是\emph{induced},当且仅当存在由$u$和$v$的叶后代共享的标签。在HIA查询中,给定节点$x \in T_1$和$y \in T_2$,目标是找到具有最大总权重的诱导节点对$(u, v)$,使得$u$是~ $x$的祖先,并且$v$是$y$的祖先。假设$n$是两棵树大小的上界。众所周知,没有大小为$\tilde{\mathcal{O}}(n)$的数据结构可以在$o(\log n / \log \log n)$时间内回答HIA查询[Charalampopoulos,Gawrychowski,Pokorski; ICALP 2020]。这个(无条件)下限是一个$\operatorname{polyloglog} n$因子,与HIA问题迄今为止已知的最快的$\tilde{\mathcal{O}}(n)$大小的数据结构的查询时间不同[Abedin,Hooshmand,Ganguly,Chaachan; Chaimica 2022]。在这项工作中,我们解决了HIA问题的查询时间复杂度的近线性空间制度,提出了一个数据结构,可以建立在$\tilde{\mathcal{O}}(n)$时间和回答HIA查询在$\mathcal{O}(\log n/\log\log n)$时间。作为一个直接的推论,我们得到一个$\tilde{\mathcal{O}}(n)$大小的数据结构,保持LCS的静态字符串和动态字符串,两者的长度最多$n$,在时间上最佳的空间制度。我们的方法的主要成分是分数级联和利用一个$\mathcal{O}(\log n/ \log\log n)$深度树分解。

英文摘要:

We revisit the Heaviest Induced Ancestors (HIA) problem that was introduced by Gagie, Gawrychowski, and Nekrich [CCCG 2013] and has a number of applications in string algorithms. Let $T_1$ and $T_2$ be two rooted trees whose nodes have weights that are increasing in all root-to-leaf paths, and labels on the leaves, such that no two leaves of a tree have the same label. A pair of nodes $(u, v)\in T_1 \times T_2$ is \emph{induced} if and only if there is a label shared by leaf-descendants of $u$ and $v$. In an HIA query, given nodes $x \in T_1$ and $y \in T_2$, the goal is to find an induced pair of nodes $(u, v)$ of the maximum total weight such that $u$ is an ancestor of~$x$ and $v$ is an ancestor of $y$. Let $n$ be the upper bound on the sizes of the two trees. It is known that no data structure of size $\tilde{\mathcal{O}}(n)$ can answer HIA queries in $o(\log n / \log \log n)$ time [Charalampopoulos, Gawrychowski, Pokorski; ICALP 2020]. This (unconditional) lower bound is a $\operatorname{polyloglog} n$ factor away from the query time of the fastest $\tilde{\mathcal{O}}(n)$-size data structure known to date for the HIA problem [Abedin, Hooshmand, Ganguly, Thankachan; Algorithmica 2022]. In this work, we resolve the query-time complexity of the HIA problem for the near-linear space regime by presenting a data structure that can be built in $\tilde{\mathcal{O}}(n)$ time and answers HIA queries in $\mathcal{O}(\log n/\log\log n)$ time. As a direct corollary, we obtain an $\tilde{\mathcal{O}}(n)$-size data structure that maintains the LCS of a static string and a dynamic string, both of length at most $n$, in time optimal for this space regime. The main ingredients of our approach are fractional cascading and the utilization of an $\mathcal{O}(\log n/ \log\log n)$-depth tree decomposition.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑