Abstract. Preliminary to most comparative genomics studies is the annotation of chromosomes as ordered sequences of genes. Unfortunately, different genetic mapping techniques usual...
Guillaume Blin, Eric Blais, Pierre Guillon, Mathie...
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 ...
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...
Rui Mao, Wenguo Liu, Daniel P. Miranker, Qasim Iqb...
Ð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...
Richard Myers, Richard C. Wilson, Edwin R. Hancock
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...