1421 search results - page 17 / 285 » Algorithms for subsequence combinatorics |
AAIM
2006
Springer
15 years 3 months ago
2006
Springer
We study the subsequence packing problem: given a string T and a collection of strings {Si}, find disjoint subsequences {Ti} of T with maximum total length such that each Ti is a ...
BIBE
2005
IEEE
15 years 3 months ago
2005
IEEE
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
99
Voted
SDM
2007
SIAM
14 years 11 months ago
2007
SIAM
In this paper, we explore the discriminating subsequencebased clustering problem. First, several effective optimization techniques are proposed to accelerate the sequence mining p...
81
Voted
ENDM
2008
14 years 9 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...
ICDE
2012
IEEE
12 years 12 months ago
2012
IEEE
—Sequence analysis is very important in our daily life. Typically, each sequence is associated with an ordered list of elements. For example, in a movie rental application, a cus...