On the complexity of directed biological networks
β Scribed by Bonchev, D.
- Book ID
- 127174293
- Publisher
- Taylor and Francis Group
- Year
- 2003
- Tongue
- English
- Weight
- 370 KB
- Volume
- 14
- Category
- Article
- ISSN
- 1062-936X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Directed-path (DP) singly-connected Bayesian networks are an interesting special case that, in particular, includes both polytrees and two-level networks. We analyze the computational complexity of these networks. The prediction problem is shown to be easy, as standard message passing can perform co
The effect of directionality on the information propagation in a contagion model with complex propagation, i.e., that takes into account the need for simultaneous exposure to multiple activation sources, is studied. While it is known that complex propagation is blocked with increasing network random
The theory of directed switching networks is developed. After the fundamental concepts are defined, the rank of the path matrix of a Directed Single-Contact (Di-SC) network is discussed. The theorem which gives the essential relationship between the SC and Di-SC networks is proved. Then the Odd-Addi