Question: 5. The algorithm for computing LCS(X,Y) builds a table of size m.n. For very long strings, this memory requirement is quite high. Explain how to

5. The algorithm for computing LCS(X,Y) builds a table of size m.n. For very long strings, this memory requirement is quite high. Explain how to compute |LCS(X,Y) in time O(mn) and memory 0(m+n)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
