A subsequence of a string s is any string that can be...

A subsequence of a string $s$ is any string that can be obtained by deleting characters from $s$. Consider two strings $x$ and $y$ of length $n$, where each character in each string is independently a 0 with probability $1 / 2$ and a 1 with probability $1 / 2$. We consider the longest common subsequence of the two strings. (a) Show that the expected length of the longest common subsequence is greater than $c_{1} n$ and less than $c_{2} n$ for constants $c_{1}>1 / 2$ and $c_{2}<1$ when $n$ is sufficiently large. (Any constants $c_{1}$ and $c_{2}$ will do; as a challenge, you may attempt to find the best constants $c_{1}$ and $c_{2}$ that you can.) (b) Use a martingale inequality to show that the length of the longest common subsequence is highly concentrated around its mean.

A subsequence of a string $s$ is any string that can be obtained by deleting characters from $s$. Consider two strings $x$ and $y$ of length $n$, where each character in each string is independently a 0 with probability $1 / 2$ and a 1 with probability $1 / 2$. We consider the longest common subsequence of the two strings.
(a) Show that the expected length of the longest common subsequence is greater than $c_{1} n$ and less than $c_{2} n$ for constants $c_{1}>1 / 2$ and $c_{2}<1$ when $n$ is sufficiently large. (Any constants $c_{1}$ and $c_{2}$ will do; as a challenge, you may attempt to find the best constants $c_{1}$ and $c_{2}$ that you can.)
(b) Use a martingale inequality to show that the length of the longest common subsequence is highly concentrated around its mean.

Key Concepts

Subsequence

A subsequence is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements. This concept is fundamental in combinatorics and string analysis, where it is used to study various patterns and similarities between sequences.

Longest Common Subsequence

The longest common subsequence (LCS) of two strings is the longest sequence that appears as a subsequence in both strings. It is a key concept in computer science, particularly in the fields of dynamic programming, sequence alignment, and analysis of algorithms, as it measures the similarity between two sequences.

Random Binary Strings

Random binary strings are sequences of binary digits (0s and 1s) where each digit is chosen independently with equal probability. This randomness introduces a probabilistic framework to the problem, requiring statistical and combinatorial techniques to analyze properties such as the length of the LCS.

Expected Value Analysis

In the context of the LCS for random binary strings, expected value analysis involves determining bounds for the average length of the LCS as the string length grows. This analysis uses probabilistic methods to show that the expected LCS length is linear in the string length, providing both lower and upper bounds with specified constant factors.

Martingales and Azuma's Inequality

Martingales are sequences of random variables that model fair games, and they are a powerful tool in probability theory for studying the concentration of measure. Azuma's inequality, a specific martingale concentration inequality, is used to show that the LCS length does not deviate much from its expected value, demonstrating high concentration around the mean. This technique is crucial in probabilistic combinatorics to establish stability of outcomes in random settings.

Transcript

Please give Ace some feedback