441 search results - page 8 / 89 » Optimal Subsequence Bijection |
125
click to vote
SAS
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Pointer information is a prerequisite for most program analyses, and inclusion-based, i.e. Andersen-style, pointer analysis is widely used to compute such information. Ho...
146
click to vote
CIBCB
2007
IEEE
15 years 11 months ago
2007
IEEE
—DNA matching is a crucial step in sequence alignment. Since sequence alignment is an approximate matching process there is a need for good approximate algorithms. The process of...
129
click to vote
ALGORITHMICA
2006
15 years 5 months ago
2006
We study the problem of computing the k maximum sum subsequences. Given a sequence of real numbers x1, x2, . . . , xn and an integer parameter k, 1 k 1 2 n(n - 1), the problem in...
140
click to vote
ICDM
2005
IEEE
15 years 10 months ago
2005
IEEE
We consider the problem of elastic matching of time series. We propose an algorithm that determines a subsequence of a target time series that best matches a query series. In the ...
116
Voted
DIS
2006
Springer
15 years 8 months ago
2006
Springer
This paper introduces a new family of string classifiers based on local relatedness. We use three types of local relatedness measurements, namely, longest common substrings (LCStr&...