Prof.
Sui Huang
(Harvard)
16/07/2007, 15:00
Prof.
Sergey Nechaev
(CNRS)
16/07/2007, 17:30
Finding 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...
