304 views
0 votes
0 votes
While solving the problem of longest match subsequence we use the concept of dynamic programming which further uses tabulation. For given 2 strings we can create a table using 2D matrix but how we'll draw the same table for 3 or more number of strings?

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
karan25gupta asked Apr 17, 2019
675 views
In 0/1 knapsack problem ,suppose if maximum weight is given as W and we are asked to find out max profit then * IS IT NECESSARY THAT THE TOTAL WEIGHT SHOULD BE EXACTLY EQ...
2 votes
2 votes
2 answers
2
Nivedita Singh asked Dec 8, 2018
1,470 views
Is there any shortcut or Trick to get min number of multiplication faster? I mean if we could know the right split.
0 votes
0 votes
1 answer
3
Rustam Ali asked Sep 11, 2018
353 views
How many distinct function calls are there in LCS(m,n)=. How to calculate it?