356 citations · 358 across the 3 of their papers we have counts for
4 papers
Counting attractors in synchronously updated random Boolean networks
Björn Samuelsson, Carl Troein
Despite their apparent simplicity, random Boolean networks display a rich variety of dynamical behaviors. Much work has been focused on the properties and abundance of attractors.…
Genetic networks with canalyzing Boolean rules are always stable
Stuart Kauffman, Carsten Peterson, Björn Samuelsson +1
We determine stability and attractor properties of random Boolean genetic network models with canalyzing rules for a variety of architectures. For all power law, exponential, and f…
The Number of Attractors in Kauffman Networks
B. Samuelsson, C. Troein
The Kauffman model describes a particularly simple class of random Boolean networks. Despite the simplicity of the model, it exhibits complex behavior and has been suggested as a m…
Enumerating Designing Sequences in the HP Model
Anders Irbäck, Carl Troein
The hydrophobic/polar HP model on the square lattice has been widely used to investigate basics of protein folding. In the cases where all designing sequences (sequences with uniqu…