Simulations, Computations, and Statistics for Longest Common Subsequences
From MaRDI portal
Publication:6286865
arXiv1705.06826MaRDI QIDQ6286865FDOQ6286865
Authors: Qingqing Liu, Christian Houdré 
Publication date: 18 May 2017
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.
Parametric hypothesis testing (62F03) Monte Carlo methods (65C05) Permutations, words, matrices (05A05) Combinatorial probability (60C05)
This page was built for publication: Simulations, Computations, and Statistics for Longest Common Subsequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6286865)
