Longest Common Subsequence

Posted by tsudot on Stack Overflow See other posts from Stack Overflow or by tsudot
Published on 2010-06-09T05:53:32Z Indexed on 2010/06/09 6:12 UTC
Read the original article Hit count: 222

Filed under:

time-complexity

|

dynamic-programming

|

lcs

Consider 2 sequences X[1..m] and Y[1..n]. The memoization algorithm would compute the LCS in time O(m*n). Is there any better algorithm to find out LCS wrt time? I guess memoization done diagonally can give us O(min(m,n)) time complexity.

© Stack Overflow or respective owner

Related posts about time-complexity

Time complexity of Sieve of Eratosthenes algorithm

as seen on Stack Overflow - Search for 'Stack Overflow'
From Wikipedia: The complexity of the algorithm is O(n(logn)(loglogn)) bit operations. How do you arrive at that? That the complexity includes the loglogn term tells me that there is a sqrt(n) somewhere. Suppose I am running the sieve on the first 100 numbers (n = 100)… >>> More
Time complexity of a sorting algorithm

as seen on Stack Overflow - Search for 'Stack Overflow'
The two programs below get n integers from file and calculates the sum of ath to bth integers q(number of question) times. I think the upper program has worse time complexity than the lower, but I'm having problems calculating the time complexity of these two algorithms. [input sample] 5 3 5 4 3… >>> More
Time complexity for Search and Insert operation in sorted and unsorted arrays that includes duplicat

as seen on Stack Overflow - Search for 'Stack Overflow'
1-)For sorted array I have used Binary Search. We know that the worst case complexity for SEARCH operation in sorted array is O(lg N), if we use Binary Search, where N are the number of items in an array. What is the worst case complexity for the search operation in the array that includes duplicate… >>> More
Time complexity of a certain program

as seen on Stack Overflow - Search for 'Stack Overflow'
In a discussion with my friend i am not able to predict correct and tight time complexity of a program. Program is as below. /* This Function reads input array "input" and update array "output" in such a way that B[i] = index value of nearest greater value from A[i], A[i+1] ... A[n], for all i belongs… >>> More
Time complexity with bit cost

as seen on Stack Overflow - Search for 'Stack Overflow'
I think I might have completely misunderstood bit cost analysis. I'm trying to wrap my head around the concept of studying an algorithm's time complexity with respect to bit cost (instead of unit cost) and it seems to be impossible to find anything on the subject. Is this considered to be so trivial… >>> More

Related posts about dynamic-programming

dynamic programming [closed]

as seen on Stack Overflow - Search for 'Stack Overflow'
the input to this problem is a sequence S of integers(not necessarily positive). the problem is to find consecutive subsequence of S with maximum sum using dynamic programming. consecutive means that you are not allowed to skip numbers. for example: if the input was 12,-14,1,23,-6,22,-34,-13. the… >>> More
Dynamic Programming Recursion and a sprinkle of Memoization

as seen on Stack Overflow - Search for 'Stack Overflow'
I have this massive array of ints from 0-4 in this triangle. I am trying to learn dynamic programming with Ruby and would like some assistance in calculating the number of paths in the triangle that meet three criterion: You must start at one of the zero points in the row with 70 elements. Your… >>> More
Need help with dynamic programming problem

as seen on Stack Overflow - Search for 'Stack Overflow'
I have the following problem : I am given a tree with N apples, for each apple I am given it's weight and height,I can pick apples up to a given height H,each time I pick an apple the height of every apple is increased with U(also given).I have to find out the maximum weight of apples I can pick.… >>> More
Algorithm and data structure learning resources for dynamic programming

as seen on Stack Overflow - Search for 'Stack Overflow'
Im learning dynamic programming now, and while I know the theory well, designing DP algorithms for new problems is still difficult. This is what i would really like now- A book or a website, which poses a problem which can be solved by dynamic programming. Also there is the solution with an explanation… >>> More
How to speed up calculation of length of longest common substring?

as seen on Stack Overflow - Search for 'Stack Overflow'
I have two very large strings and I am trying to find out their Longest Common Substring. One way is using suffix trees (supposed to have a very good complexity, though a complex implementation), and the another is the dynamic programming method (both are mentioned on the Wikipedia page linked above)… >>> More