Sciweavers

1090 search results - page 5 / 218
» The Equivalence between Biology and Computation
Sort
View
RECOMB
2007
Springer
14 years 10 months ago
How to Achieve an Equivalent Simple Permutation in Linear Time
The problem of Sorting signed permutations by reversals is a well studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pev...
Simon Gog, Martin Bader
NIPS
1998
13 years 11 months ago
Computational Differences between Asymmetrical and Symmetrical Networks
Symmetrically connected recurrent networks have recently been used as models of a host of neural computations. However, biological neural networks have asymmetrical connections, at...
Zhaoping Li, Peter Dayan
ASM
2010
ASM
14 years 6 months ago
Synchronous Message Passing and Semaphores: An Equivalence Proof
A natural encoding of synchronous message exchange with direct wait-control is proved to be equivalent in a distributed environment to a refinement which uses semaphores to implem...
Iain Craig, Egon Börger
BMCBI
2007
168views more  BMCBI 2007»
13 years 9 months ago
GOSim - an R-package for computation of information theoretic GO similarities between terms and gene products
Background: With the increased availability of high throughput data, such as DNA microarray data, researchers are capable of producing large amounts of biological data. During the...
Holger Fröhlich, Nora Speer, Annemarie Poustk...
CCS
2008
ACM
13 years 11 months ago
Computational soundness of observational equivalence
Many security properties are naturally expressed as indistinguishability between two versions of a protocol. In this paper, we show that computational proofs of indistinguishabili...
Hubert Comon-Lundh, Véronique Cortier