The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Background: One of the important challenges in microarray analysis is to take full advantage of previously accumulated data, both from one's own laboratory and from public re...
Kyu Baek Hwang, Sek Won Kong, Steven A. Greenberg,...
— Successful biological image analysis usually requires satisfactory segmentations to identify regions of interest as an intermediate step. Here we present a novel graphical mode...
Shann-Ching Chen, Ting Zhao, Geoffrey J. Gordon, R...
In this paper, we present an efficient system for action recognition from very short sequences. For action recognition typically appearance and/or motion information of an action ...