596 search results - page 98 / 120 » Complexity Analysis by Graph Rewriting |
CEEMAS
2001
Springer
14 years 19 days ago
2001
Springer
Developing multi-agent simulations seems to be rather straight forward, as active entities in the original correspond to active agents in the model. Thus plausible behaviors can be...
BMCBI
2008
13 years 8 months ago
2008
Background: New systems biology studies require researchers to understand how interplay among myriads of biomolecular entities is orchestrated in order to achieve high-level cellu...
SODA
1992
ACM
13 years 9 months ago
1992
ACM
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
BMCBI
2004
13 years 8 months ago
2004
Background: Microarray and other high-throughput technologies are producing large sets of interesting genes that are difficult to analyze directly. Bioinformatics tools are needed...
BMCBI
2008
13 years 8 months ago
2008
Background: High-throughput methods that allow for measuring the expression of thousands of genes or proteins simultaneously have opened new avenues for studying biochemical proce...