Abstract:The expected value E of the longest common subsequence of letters in two random words is considered as a function of the α = |A| of alphabet and of words lengths m and n. It is assumed that each letter independently appears at any position with equal probability. A simple expression for E(α, m, n) and its empirical proof are presented for fixed α and m + n. High accuracy of the formula in a wide range of values is confirmed by numerical simulations.
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.