lcs
All Longest Common Subsequences
[NOTE: I searched beforehand and couldn\'t find advice on solving the LCS problem for all subsequences.][详细]
2023-04-04 09:59 分类:问答Fast(er) algorithm for the Length of the Longest Common Subsequence (LCS)
Problem: Need the Length of the LCS between two strings. The size of the strings is at most 100 characters. The alphabet is the usual DNA one, 4 characters \"ACGT\". The dynamic approach is not quick[详细]
2023-03-16 17:33 分类:问答Longest common subsequence of 3+ strings
I am trying to find the longest common subsequence of 3 or more strings. The Wikipedia article has a great description of how to do this for 2 strings, but I\'m a little unsure of how to extend this t[详细]
2023-02-12 08:22 分类:问答Suffix Tree: Longest repeating substring implementation
I have implemented a suffix tree, which is not compressed. I wanted to know how to solve the problem of finding the longest repreating substring in a string. I know that we have to find the deepest in[详细]
2023-01-31 01:40 分类:问答efficient longest common subsequence algorithm library?
I\'m looking for a (space) efficient implementation of an LCS algorithm for use in a C++ program. Inputs are two random access sequences of integers.[详细]
2023-01-14 22:48 分类:问答Longest Common Subsequence
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 f开发者_StackOverflow社区ind out LCS wrt time? I guess memoiz[详细]
2023-01-03 07:03 分类:问答How to speed up calculation of length of longest common substring?
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开发者[详细]
2022-12-27 22:28 分类:问答