1696 search results - page 49 / 340 » Permuted function matching |
SPIRE
2004
Springer
15 years 8 months ago
2004
Springer
This paper presents a generalization of the notion of longest repeats with a block of k don’t care symbols introduced by [8] (for k fixed) to longest motifs composed of three pa...
113
Voted
SODA
2010
ACM
15 years 12 months ago
2010
ACM
We present a new optimization technique that yields the first FPTAS for several geometric problems. These problems reduce to optimizing a sum of non-negative, constant description...
104
click to vote
SSC
2007
Springer
15 years 8 months ago
2007
Springer
Any span n sequences can be regarded as filtering sequences. From this observation, new randomness criteria for span n sequences are proposed. It is proved that the feedback funct...
129
click to vote
COR
1999
15 years 2 months ago
1999
This article describes applications of modern heuristic search methods to pattern sequencing problems, i.e., problems seeking for a permutation of the rows of a given matrix with r...
143
Voted
SODA
1997
ACM
15 years 3 months ago
1997
ACM
Given two planar polylines T and P with n and m edges, respectively, we present an O m2 n2 time, O mn space algorithm to nd portions of the text" T which are similar in sh...