Sciweavers

1278 search results - page 161 / 256
» Information Analysis of DNA Sequences
Sort
View
TCS
2008
15 years 6 months ago
Algorithms for computing variants of the longest common subsequence problem
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...
Costas S. Iliopoulos, M. Sohel Rahman
AI
2010
Springer
15 years 6 months ago
Optimal query complexity bounds for finding graphs
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 ...
Sung-Soon Choi, Jeong Han Kim
BMCBI
2004
206views more  BMCBI 2004»
15 years 6 months ago
Combining gene expression data from different generations of oligonucleotide arrays
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,...
CIBCB
2006
IEEE
16 years 13 days ago
A Novel Graphical Model Approach to Segmenting Cell Images
— 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...
SCIA
2009
Springer
132views Image Analysis» more  SCIA 2009»
16 years 28 days ago
Instant Action Recognition
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 ...
Thomas Mauthner, Peter M. Roth, Horst Bischof