从超序列聚类到单删除和双删除的熵最小化子序列
From Clustering Supersequences to Entropy Minimizing Subsequences for Single and Double Deletions
摘要:
通过无记忆的i.i.d.传输的二进制字符串。删除信道作为原始输入的子序列被接收。由此,获得信道输入上的后验分布,其对应于由接收到的子序列可以嵌入其中的次数加权的一组候选超序列。在以前的工作中,它是apertured的实验数据的基础上,后的熵最小化和最大化的常数和交替字符串,分别。在这项工作中,除了重温熵最小化猜想,我们还解决了几个相关的组合问题。我们提出了一个算法,用于计数的子序列嵌入使用字符串的行程长度编码的数量。然后,我们描述的超序列空间的聚类方法,使所得到的集合的基数只取决于收到的子序列的长度和汉明重量,但不是它的确切形式。然后,我们考虑超序列,包含一个固定的子序列,称为单例的单一嵌入,并提供了一个封闭的形式使用相同的行程长度编码枚举它们的表达式。我们证明了一个类似的结果的最小化和最大化的单例数,交替和均匀字符串,分别。接下来,我们证明了原来的最小熵猜想的特殊情况下,单,双删除使用类似的聚类技术和相同的行程长度编码,这使我们能够表征的子序列嵌入的数量在空间中的兼容超序列的分布,以证明熵减少操作的效果。
英文摘要:
A binary string transmitted via a memoryless i.i.d. deletion channel is received as a subsequence of the original input. From this, one obtains a posterior distribution on the channel input, corresponding to a set of candidate supersequences weighted by the number of times the received subsequence can be embedded in them. In a previous work it is conjectured on the basis of experimental data that the entropy of the posterior is minimized and maximized by the constant and the alternating strings, respectively. In this work, in addition to revisiting the entropy minimization conjecture, we also address several related combinatorial problems. We present an algorithm for counting the number of subsequence embeddings using a run-length encoding of strings. We then describe methods for clustering the space of supersequences such that the cardinality of the resulting sets depends only on the length of the received subsequence and its Hamming weight, but not its exact form. Then, we consider supersequences that contain a single embedding of a fixed subsequence, referred to as singletons, and provide a closed form expression for enumerating them using the same run-length encoding. We prove an analogous result for the minimization and maximization of the number of singletons, by the alternating and the uniform strings, respectively. Next, we prove the original minimal entropy conjecture for the special cases of single and double deletions using similar clustering techniques and the same run-length encoding, which allow us to characterize the distribution of the number of subsequence embeddings in the space of compatible supersequences to demonstrate the effect of an entropy decreasing operation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。