Question

Determine an lcs of h1; 0; 0; 1; 0; 1; 0; 1i and h0; 1; 0; 1; 1; 0; 1; 1; 0

Answer 1

Step 1 of 5

Consider X and Y are two sequences.

X=, length of X, m=8

Y=, length of Y, n=9

To find the longest common subsequence (LCS), apply the LCS – LENGTH(X, Y) algorithm on the sequences X=and

Y=. Then the LCS-LENGTH returns the table c[0…8,0…9] andb[1…8,1…9].

The table c and b are as follows:

j

0

1

2

3

4

5

6

7

8

9

i



0

1

0

1

1

0

1

1

0

0



0

0

0

0

0

0

0

0

0

0

1

1

0



















2

0

0



















3

0

0



















4

1

0



















5

0

0



















6

1

0



















7

0

0



















8

1

0

















Answer 2

Answer:

uncountibly

Step-by-step explanation: