arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2101.12341cs.DS
收藏

$r$ -指标Wheeler图

$r$-indexing Wheeler graphs

Travis Gagie

摘要:

设$G$是一个Wheeler图,$r$是$G$的Burrows-Wheeler变换中的游程数,并假设$G$可以分解为$\upsilon$边不相交的有向路,其内部顶点的入度和出度均为1.我们展示了如何存储$G$在$O (r + \upsilon)$空间,这样以后,给定一个模式$P$,在$O (|P| \log \log |G|)$的时间,我们可以计算$G$的顶点可达的有向路径标记$P$,然后报告这些顶点在$O (\log \log |G|)$时间每个顶点。

英文摘要:

Let $G$ be a Wheeler graph and $r$ be the number of runs in a Burrows-Wheeler Transform of $G$, and suppose $G$ can be decomposed into $\upsilon$ edge-disjoint directed paths whose internal vertices each have in- and out-degree exactly 1. We show how to store $G$ in $O (r + \upsilon)$ space such that later, given a pattern $P$, in $O (|P| \log \log |G|)$ time we can count the vertices of $G$ reachable by directed paths labelled $P$, and then report those vertices in $O (\log \log |G|)$ time per vertex.

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

↑