Longest common subsequence: Difference between revisions
m
Removed duplicate Examples section.
(Updated Introduction.) |
m (Removed duplicate Examples section.) |
||
Line 16:
If i1 ≤ i2 and j2 ≤ j1 (or i2 ≤ i1 and j1 ≤ j2) then neither m1 < m2 nor m1 > m2 are possible; and m1, m2 are ''incomparable''.
Defining (#) to denote this case, we write m1 # m2. Because the underlying product
Because the product
Given a product-order over the set of matches '''M''', a chain '''C''' is any subset of '''M''' where m1 <> m2 for every pair of distinct elements m1 and m2 of '''C'''. Similarly, an antichain '''D''' is any subset of '''M''' where m1 # m2 for every pair of distinct elements m1 and m2 of '''D'''.
Line 78:
Elsevier Science [Volume 75, ''pp.'' 275–281]
<br />
'''Examples'''
| |||