564 search results - page 21 / 113 » Some Results on the Expressive Power and Complexity of LSCs |
BMCBI
2006
14 years 9 months ago
2006
Background: DNA microarray technology provides a powerful tool for characterizing gene expression on a genome scale. While the technology has been widely used in discovery-based m...
CSL
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Although Cai, F¨urer and Immerman have shown that fixedpoint logic with counting (IFP + C) does not express all polynomialtime properties of finite structures, there h...
80
Voted
ICDT
1995
ACM
15 years 1 months ago
1995
ACM
We investigate and compare two forms of recursion on sets for querying nested collections. The rst one is called sri and it corresponds to sequential processing of data. The second...
BMCBI
2005
14 years 9 months ago
2005
Background: It is common for the results of a microarray study to be analyzed in the context of biologically-motivated groups of genes such as pathways or Gene Ontology categories...
158
Voted
LCC
1994
15 years 1 months ago
1994
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...