905 search results - page 22 / 181 » On the Complexity of uSPR Distance |
RECOMB
2006
Springer
14 years 8 months ago
2006
Springer
Abstract. Preliminary to most comparative genomics studies is the annotation of chromosomes as ordered sequences of genes. Unfortunately, different genetic mapping techniques usual...
FOCS
2005
IEEE
14 years 2 months ago
2005
IEEE
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
IEEECIT
2005
IEEE
14 years 2 months ago
2005
IEEE
Similarity search leveraging distance-based index structures is increasingly being used for complex data types. It has been shown that for high dimensional uniform vectors with si...
ICIAP
1999
ACM
14 years 21 days ago
1999
ACM
ÐThis paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of edit-distance originally introduced for graph-matchi...
IPPS
1997
IEEE
14 years 19 days ago
1997
IEEE
This paper presents a parallel algorithm for the weighted distance transform and the nearest feature transform of an n 2 n binary image. We show that the algorithm runs in O(log n...