Biology, asked by honeydrall6719, 10 months ago

Explain how to use a code for lcs to find the longest nucleotide palindromic subsequence of any dna sequence.

Answers

Answered by Vaibhavverma73
1

Answer:

The naive solution for this problem is to generate all subsequences of the given sequence and find the longest palindromic subsequence. This solution is exponential in term of time complexity. Let us see how this problem possesses both important properties of a Dynamic Programming (DP) Problem and can efficiently solved using Dynamic Programming.

Similar questions