We study problems of reconguration of shortest paths in graphs. We prove that the shortest reconguration sequence can be exponential in the size of the graph and that it is NP-hard...
We address the problem of detecting consensus motifs, that occur with subtle variations, across multiple sequences. These are usually functional domains in DNA sequences such as t...
Computers should be able to detect and track the articulated 3-D pose of a human being moving through a video sequence. Incremental tracking methods often prove slow and unreliabl...
The Universal PBM Resource for OligonucleotideBinding Evaluation (UniPROBE) database is a centralized repository of information on the DNAbinding preferences of proteins as determ...
Some of the most successful algorithms for the automated segmentation of images use an Active Regions approach, where a curve is evolved so as to maximize the disparity of its int...
Gregory Randall, Juan Cardelino, Marcelo Bertalm&i...