From Clustering Supersequences to Entropy Minimizing Subsequences for Single and Double Deletions

by   Arash Atashpendar, et al.

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, we present an algorithm for counting the number of subsequence embeddings using a run-length encoding of strings. We then describe two different ways of clustering the space of supersequences and prove that their cardinality 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.


page 1

page 2

page 3

page 4


A Proof of Entropy Minimization for Outputs in Deletion Channels via Hidden Word Statistics

From the output produced by a memoryless deletion channel from a uniform...

From Information Theory Puzzles in Deletion Channels to Deniability in Quantum Cryptography

From the output produced by a memoryless deletion channel with a uniform...

The Input and Output Entropies of the k-Deletion/Insertion Channel

The channel output entropy of a transmitted word is the entropy of the p...

A Separation Between Run-Length SLPs and LZ77

In this paper we give an infinite family of strings for which the length...

Reconstruction of Strings from their Substrings Spectrum

This paper studies reconstruction of strings based upon their substrings...

The Chvátal-Sankoff problem: Understanding random string comparison through stochastic processes

Given two equally long, uniformly random binary strings, the expected le...

Overcoming a Theoretical Limitation of Self-Attention

Although transformers are remarkably effective for many tasks, there are...

Please sign up or login with your details

Forgot password? Click here to reset