10988 search results - page 1723 / 2198 » Algorithmic Folding Complexity |
203
Voted
KDD
2008
ACM
16 years 7 months ago
2008
ACM
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
175
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
Joint mining of multiple data sets can often discover interesting, novel, and reliable patterns which cannot be obtained solely from any single source. For example, in cross-marke...
310
Voted
POPL
2005
ACM
16 years 7 months ago
2005
ACM
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
157
click to vote
RECOMB
2005
Springer
16 years 7 months ago
2005
Springer
Abstract. One of the simplest evolutionary models has molecular sequences evolving from a common ancestor down a bifurcating phylogenetic tree, experiencing point-mutations along t...
175
click to vote
RECOMB
2002
Springer
16 years 7 months ago
2002
Springer
We introduce a model-based analysis technique for extracting and characterizing rhythmic expression pro les from genome-wide DNA microarray hybridization data. These patterns are ...