2008 Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)
Abstract:It has long been known [2] that the average length of the longest common subsequence of two random strings of length n over an alphabet of size k is asymptotic to γ k n for some constant γ k depending on k. The value of these constants remains unknown, and a number of papers have proved upper and lower bounds on them. In particular, in [6] we used a modification of methods of [3,4] for determining lower and upper bounds on γ k , combined with large computer computations, to obtain improved bounds on γ 2 . The… Show more
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.