An iterative approach to determining the length of the longest common subsequence of two strings
This paper concerns the longest common subsequence (LCS) shared by two sequences (or strings) of length N, whose elements are chosen at random from a finite alphabet. The exact distribution and the expected value of the length of the LCS, k say, between two random sequences is still an open problem in applied probability. While the expected value E(N) of the length of the LCS of two random strings is known to lie within certain limits, the exact value of E(N) and the exact distribution are...[Show more]
|Collections||ANU Research Publications|
|Source:||Methodology and Computing in Applied Probability|
|01_Booth_An_iterative_approach_to_2004.pdf||1.02 MB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.