10608 search results - page 1643 / 2122 » Complexity of O'Hara's Algorithm |
353
click to vote
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...
187
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...
191
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 ...
226
Voted
PODS
2003
ACM
16 years 7 months ago
2003
ACM
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...
219
click to vote
PODS
2008
ACM
16 years 7 months ago
2008
ACM
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...