2000 character limit reached
Simulations, Computations, and Statistics for Longest Common Subsequences
Published 18 May 2017 in math.PR | (1705.06826v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.