3 votes 3 votes The longest common subsequence of the sequences $X=<A, B, C, B, D, A, B>$ and $Y=<B, D, C, A, B, A>$ has length $2$ $3$ $4$ $5$ Algorithms ugcnetcse-dec2013-paper3 algorithms dynamic-programming + – go_editor asked Jul 28, 2016 edited Jun 10, 2020 by soujanyareddy13 go_editor 5.6k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 3 votes 3 votes 4 is ans i.e. BDAB , BCAB , BCBA . Prashant. answered Jul 28, 2016 edited Nov 15, 2016 by Prashant. Prashant. comment Share Follow See 1 comment See all 1 1 comment reply Prateek kumar commented Nov 15, 2016 reply Follow Share edit: - it would be BDAB NOT BDBA 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes The LCS of X and Y are BCBA , BDAB, BDBA (which can be obsereved from the list they may or may not be continuous in appearance ) i.e are of length 4 hence C is the ans Sanjay Sharma answered Jul 28, 2016 Sanjay Sharma comment Share Follow See all 0 reply Please log in or register to add a comment.