81 search results - page 2 / 17 » Repetition-free longest common subsequence |
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
AAIM
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. The Longest Common Subsequence (LCS) problem is a classic and well-studied problem in computer science. The LCS problem is a common task in DNA sequence analysis with man...
ENDM
2008
13 years 5 months ago
2008
We study the problem of, given two sequences x and y over a finite alphabet, finding a repetitionfree longest common subsequence of x and y. We show several algorithmic results, a...
FCS
2006
2006
Another Algorithm for Computing Longest Common Increasing Subsequence for Two Random Input Sequences
13 years 7 months ago
We have previously developed several algorithms which deal with different input sequence scenarios respectively. In this paper, another sequential algorithm for computing Longest ...
IPPS
2003
IEEE
13 years 10 months ago
2003
IEEE
Given two strings and of lengths Ñ and Ò, respectively, the all-substrings longest common subsequence (ALCS) problem obtains the lengths of the subsequences common to and any su...