-
Prof. Sui Huang (Harvard)7/16/07, 3:00 PM
-
Dr Arne Traulsen (Harvard)7/16/07, 4:30 PM
-
Prof. Sergey Nechaev (CNRS)7/16/07, 5:30 PMFinding analytically the statistics of the longest common subsequence (LCS) of a pair of random sequences drawn from c alphabets is a challenging problem in computational evolutionary biology. We present exact asymptotic results for the distribution of the LCS in a simpler, yet nontrivial, variant of the original model called the Bernoulli matching (BM) model. We show that...Go to contribution page
Choose timezone
Your profile timezone: