1421 search results - page 1 / 285 » Algorithms for subsequence combinatorics |
CPM
2006
Springer
13 years 10 months ago
2006
Springer
TCS
2008
13 years 6 months ago
2008
A subsequence is obtained from a string by deleting any number of characters; thus in contrast to a substring, a subsequence is not necessarily a contiguous part of the string. Co...
COMBINATORICS
2007
13 years 6 months ago
2007
COMBINATORICS
1999
13 years 5 months ago
1999
CPM
2006
Springer
13 years 10 months ago
2006
Springer
For two strings a, b, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In a previous paper, we defined a generalisat...