## Longest Common Subsequences (1994)

Venue: | In Proc. of 19th MFCS, number 841 in LNCS |

Citations: | 29 - 1 self |

### BibTeX

@INPROCEEDINGS{Paterson94longestcommon,

author = {Mike Paterson and Vlado Dancik},

title = {Longest Common Subsequences},

booktitle = {In Proc. of 19th MFCS, number 841 in LNCS},

year = {1994},

pages = {127--142},

publisher = {Springer}

}

### OpenURL

### Abstract

. The length of a longest common subsequence (LLCS) of two or more strings is a useful measure of their similarity. The LLCS of a pair of strings is related to the `edit distance', or number of mutations /errors/editing steps required in passing from one string to the other. In this talk, we explore some of the combinatorial properties of the suband super-sequence relations, survey various algorithms for computing the LLCS, and introduce some results on the expected LLCS for pairs of random strings. 1 Introduction The set \Sigma of finite strings over an unordered finite alphabet \Sigma admits of several natural partial orders. Some, such as the substring, prefix, and suffix relations, depend on contiguity and lead to many interesting combinatorial questions with practical applications to string-matching. An excellent survey is given by Aho in [1]. In this talk however we will focus on the `subsequence' partial order. We say that u = u 1 \Delta \Delta \Delta um is a subsequence of ...