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

流中的近似汉明距离

Approximate Hamming distance in a stream

Raphael Clifford, Tatiana Starikovskaya

摘要:

我们考虑的问题,计算一个$(1+ε)$近似的汉明距离之间的模式的长度$n$和连续的子串的流。我们首先看一下这个问题的单向随机通信复杂性,给Alice流的前半部分,给Bob流的后半部分。我们证明了:(1)如果Alice和Bob共享模式,则存在$O(ε^{-4} \log^2 n)$位随机化单向通信协议。(2)如果只有Alice具有该模式,则存在$O(ε^{-2}\sqrt{n}\log n)$比特随机化的单向通信协议。然后,我们继续开发小空间流算法的$(1+ε)$ -近似汉明距离,最坏情况下的运行时间保证每个到达的符号。(1)对于二进制输入字母,存在$O(ε^{-3} \sqrt{n} \log^{2} n)$空间和$O(ε^{-2} \log{n})$时间流$(1+ε)$ -近似汉明距离算法。(2)对于一般的输入字母,存在$O(ε^{-5} \sqrt{n} \log^{4} n)$空间和$O(ε^{-4} \log^3 {n})$时间流$(1+ε)$ -近似汉明距离算法。

英文摘要:

We consider the problem of computing a $(1+ε)$-approximation of the Hamming distance between a pattern of length $n$ and successive substrings of a stream. We first look at the one-way randomised communication complexity of this problem, giving Alice the first half of the stream and Bob the second half. We show the following: (1) If Alice and Bob both share the pattern then there is an $O(ε^{-4} \log^2 n)$ bit randomised one-way communication protocol. (2) If only Alice has the pattern then there is an $O(ε^{-2}\sqrt{n}\log n)$ bit randomised one-way communication protocol. We then go on to develop small space streaming algorithms for $(1+ε)$-approximate Hamming distance which give worst case running time guarantees per arriving symbol. (1) For binary input alphabets there is an $O(ε^{-3} \sqrt{n} \log^{2} n)$ space and $O(ε^{-2} \log{n})$ time streaming $(1+ε)$-approximate Hamming distance algorithm. (2) For general input alphabets there is an $O(ε^{-5} \sqrt{n} \log^{4} n)$ space and $O(ε^{-4} \log^3 {n})$ time streaming $(1+ε)$-approximate Hamming distance algorithm.

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

↑