返回Google圖書搜尋

Longest Common Subsequences

Mike PatersonUniversity of Warwick. Department of Computer ScienceVlado Dancik

出版	University of Warwick, Department of Computer Science, 1994
URL	http://books.google.com.hk/books?id=3c-WGwAACAAJ&hl=&source=gbs_api

註釋Abstract: "The length of a longest common subsequence (LLCCS) of two or more strings in [sic] 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 sub- and super-sequence relations, survey various algorithms for computing the LLCS, and introduce some results on the expected LLCS for pairs of random strings."