Related Experiment Video
Updated: Apr 28, 2026

A Practical Guide to Phylogenetics for Nonexperts
Published on: February 6, 2014
Exact asymptotic results for the Bernoulli matching model of sequence alignment
Satya N Majumdar1, Sergei Nechaev
1Laboratoire de Physique Theorique (UMR C5152 du CNRS), Université Paul Sabatier, 31062 Toulouse Cedex, France.
Abstract:
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 in the BM model, for all c , the distribution of the asymptotic length of the LCS, suitably scaled, is identical to the Tracy-Widom distribution of the largest eigenvalue of a random matrix whose entries are drawn from a Gaussian unitary ensemble.
Related Concept Videos
Evolutionary Relationships through Genome Comparisons
Maxam-Gilbert Sequencing
Challenges of the Maxam-Gilbert Method
The...
Mismatch Repair
The Mutator Protein Family Plays a Key Role in DNA Mismatch Repair
The human genome has more than 3 billion base pairs of DNA per cell. Prior to cell division, that vast amount of genetic...
Expected Frequencies in Goodness-of-Fit Tests
Sign Test for Matched Pairs
To conduct the sign test, we first calculate the differences in...
Wilcoxon Signed-Ranks Test for Matched Pairs

