Simulations, Computations, and Statistics for Longest Common Subsequences
Probability
2017-05-22 v1
Abstract
The length of the longest common subsequences (LCSs) is often used as a similarity measurement to compare two (or more) random words. Below we study its statistical behavior in mean and variance using a Monte-Carlo approach from which we then develop a hypothesis testing method for sequences similarity. Finally, theoretical upper bounds are obtained for the Chv\'atal-Sankoff constant of multiple sequences.
Cite
@article{arxiv.1705.06826,
title = {Simulations, Computations, and Statistics for Longest Common Subsequences},
author = {Qingqing Liu and Christian Houdré},
journal= {arXiv preprint arXiv:1705.06826},
year = {2017}
}
Comments
12 pages, 10 figures