Skip navigation
Skip navigation

An iterative approach to determining the length of the longest common subsequence of two strings

Booth, Hilary; MacNamara, Shevarl; Nielsen, Ole; Wilson, Susan

Description

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]

CollectionsANU Research Publications
Date published: 2004
Type: Journal article
URI: http://hdl.handle.net/1885/87220
Source: Methodology and Computing in Applied Probability
DOI: 10.1023/B:MCAP.0000045088.88240.3a

Download

File Description SizeFormat Image
01_Booth_An_iterative_approach_to_2004.pdf1.02 MBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  12 November 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator