3378 search results - page 226 / 676 » A universe of binding and computation |
162
click to vote
RECOMB
2002
Springer
16 years 7 months ago
2002
Springer
This talk presents an algorithm to search for all approximate matches of a helix in a genome, where a helix is a combination of sequence and folding constraints. It is a joint wor...
135
click to vote
ICCS
2009
Springer
16 years 1 months ago
2009
Springer
My paper discusses system consequence, which is a central idea in the project to lift the theory of information flow to the general level of universal logic and the theory of ins...
167
click to vote
ICALP
2007
Springer
16 years 24 days ago
2007
Springer
Valiant’s theory of holographic algorithms is a novel methodology to achieve exponential speedups in computation. A fundamental parameter in holographic algorithms is the dimens...
174
click to vote
MEMBRANE
2007
Springer
16 years 23 days ago
2007
Springer
Some initial results on the study of conformon-P systems with negative values are reported. One model of these conformon-P systems is proved to be computationally universal while a...
186
click to vote
APPROX
2004
Springer
16 years 1 days ago
2004
Springer
In this paper we investigate the computational complexity of a combinatorial problem that arises in the reverse engineering of protein and gene networks. Our contributions are as ...