55 search results - page 9 / 11 » More Efficient Algorithms for Closest String and Substring P... |
IJFCS
2006
13 years 8 months ago
2006
Abstract. For certain problems (for example, computing repetitions and repeats, data compression applications) it is not necessary that the suffixes of a string represented in a su...
RECOMB
2002
Springer
14 years 8 months ago
2002
Springer
The field of algorithms for pairwisc biosequence similarity search is dominated by heuristic methods of high efficiency but uncertain sensitivity. One reason that more formal stri...
BMCBI
2010
13 years 8 months ago
2010
Background: A relevant problem in drug design is the comparison and recognition of protein binding sites. Binding sites recognition is generally based on geometry often combined w...
ECCV
2002
Springer
14 years 10 months ago
2002
Springer
We investigate in this article the rigid registration of large sets of points, generally sampled from surfaces. We formulate this problem as a general Maximum-Likelihood (ML) estim...
3DIM
2001
IEEE
14 years 6 days ago
2001
IEEE
Building 3D models of real-world objects by assembling views taken by a range sensor promises to be a more efficient method than manually producing CAD drawings. In this technique...