LCS in dynamic programming.
hi friend's
Anybody have idea about longest subsequence problem of dynamic programming.
😒😒😒
Anybody have idea about longest subsequence problem of dynamic programming.
😒😒😒
Replies
-
sushant005LCS (Longest common sub sequence) follows Dynamic programming.
In this case we are comparing two input string and finding the longest common sub sequence with greater length as the output. As LCS is following Dynamic problem so it has many problems with greatest and smallest length sub sequence but our optimal solution is only sub sequence with greater length.
For example:-
Let suppose we are given sequence of two input string X and Y where,
X= {a,b,c,b,d,a,b}
and Y= {b,d,c,a,b,a}
Z = {b,c,b,a} is the longest common sub sequence to both X and Y of length 4. -
Morningdot Hablu
what it means.sushant005longest common sub sequence with greater length as the output.
suppose an example.
AGGA is a longest common subsequence of x = AGCGA and y = CAGATAGAG.
where i use this. -
sushant005LCS as the name suggest that our optimal solution would be longest common sub sequence notice the term longest. As we all know that Dynamic programming is bottom to up approach so first we have find the all possible solutions of the given problem then we have to choose the best one called as optimal solution to the problem.
Same here, here we have many solutions of greater as well as smallest length but our optimal solution is only the sub sequence with the greatest length.
I think now you got it! -
sushant005mohit007kumar00what it means.
suppose an example.
AGGA is a longest common subsequence of x = AGCGA and y = CAGATAGAG.
where i use this.
where i use this means. -
Morningdot Hablu
suppose we have to calculate lcs of "class" and "cboy".sushant005LCS as the name suggest that our optimal solution would be longest common sub sequence notice the term longest. As we all know that Dynamic programming is bottom to up approach so first we have find the all possible solutions of the given problem then we have to choose the best one called as optimal solution to the problem.
Same here, here we have many solutions of greater as well as smallest length but our optimal solution is only the sub sequence with the greatest length.
I think now you got it!
then how many possible solutions are there please write the solutions. -
Morningdot Hablu
I want to know the use of lcs.where it is used?sushant005
where i use this means. -
sushant005
Here there are only one matching i.e c between two strings you mentioned "class" and "cboy".mohit007kumar00suppose we have to calculate lcs of "class" and "cboy".
then how many possible solutions are there please write the solutions. -
sushant005
LCS is generally used in DNA matching,file comparison etc.mohit007kumar00I want to know the use of lcs.where it is used?
1>Molecular biology. DNA sequences can be represented as sequences/base of four letters ACGT, corresponding to the four sub molecules forming DNA. One way of computing how similar two sequences are is to find the length of their longest common sub sequence.
2>File comparison. The Unix program "diff" is used to compare two different versions of the same file, to determine what changes have been made to the file. It works by finding a longest common sub sequence of the lines of the two files; any line in the sub sequence has not been changed, then it displays the remaining set of lines that have changed. In this instance of the problem we should think of each line of a file as being a single complicated character in a string. -
Morningdot Hablu
comman word is always the shortest among them then what is the means of this line.sushant005Here there are only one matching i.e c between two strings you mentioned "class" and "cboy".
"optimal solution is only the sub sequence with the greatest length" . -
vishnu priyaLCS seriously a new term to m.Just got to know it!Thanks for posting here mohit!
-
sushant005
Yes, Mohit you are very right that common word is always the shortest but here our aim is to find the solution to the problem with greatest length.There is procedure to find the solution to the problen is crealy given in Cormen, follows the steps given in Cormen you will surely get it...mohit007kumar00comman word is always the shortest among them then what is the means of this line.
"optimal solution is only the sub sequence with the greatest length" .
You are reading an archived discussion.
Related Posts
hi all of you..
Give me the names of top engineering colleges in Rajasthan that are recently opened.
I just have bought a video editting software,but when I use them to convert the
format what I want,there is something wrong,I don't know how to settle it,can you
give...
Have you ever met the following situations ,if you want to put your dvd to
another portable device,what do you often need?I want to put my dvd to my
blackberry...
Intel and Nokia are merging their Moblin and Maemo software platform forms to create a Linux-based software platform that will support multiple hardware architectures across a wide range of device...
CEans,
Amit Grover of Nurture Talent is writing articles on Entrepreneurship on VoiCE. I request all of you to check out his articles. Keep watch on VoiCE for details.
Here's...