93 search results - page 3 / 19 » Quadratic Time Algorithms for Finding Common Intervals in Tw... |
CORR
2004
Springer
13 years 4 months ago
2004
Springer
: Described are two algorithms to find long approximate palindromes in a string, for example a DNA sequence. A simple algorithm requires O(n)space and almost always runs in O(k.n)-...
RECOMB
1999
Springer
13 years 9 months ago
1999
Springer
We consider the problem of identifying common three-dimensional substructures between proteins. Our method is based on comparing the shape of the α-carbon backbone structures of ...
CP
2008
Springer
13 years 6 months ago
2008
Springer
It is acknowledged that the symbolic form of the equations is crucial for interval-based solving techniques to efficiently handle systems of equations over the reals. However, only...
IS
2008
13 years 4 months ago
2008
Discovering patterns with highly significance is an important problem in data mining discipline. An episode is defined to be a partially ordered set of events for a consecutive an...
ICPR
2008
IEEE
14 years 6 months ago
2008
IEEE
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...