write my assignment 611

For each of the following problems, the input consists of two arrays X[1 .. k] and Y [1 .. n] where k ≤ n.

Describe a recursive backtracking algorithm to find the smallest number of symbols that can be removed from Y so that X is no longer a subsequence. Equivalently, your algorithm should find the longest subsequence of Y that is not a supersequence of X. For example, after removing removing two symbols from the string PENPINEAPPLEAPPLEPEN, the string PPAP is no longer a subsequence. 

You can refer longest increasing subsequence algorithm : http://jeffe.cs.illinois.edu/teaching/algorithms/book/02-backtracking.pdf

 
"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"

Comments are closed.

Hi there! Click one of our representatives below and we will get back to you as soon as possible.

Chat with us on WhatsApp