The impact of function perturbations in Boolean networks
Author(s) -
Yufei Xiao,
Edward R. Dougherty
Publication year - 2007
Publication title -
bioinformatics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.599
H-Index - 390
eISSN - 1367-4811
pISSN - 1367-4803
DOI - 10.1093/bioinformatics/btm093
Subject(s) - boolean network , attractor , biological network , robustness (evolution) , perturbation (astronomy) , computer science , gene regulatory network , network structure , network analysis , complex network , boolean function , network topology , topology (electrical circuits) , theoretical computer science , mathematics , algorithm , biology , computer network , physics , gene , mathematical analysis , gene expression , combinatorics , quantum mechanics , biochemistry , world wide web
A network is said to be robust relative to a certain network characteristic if a small change in network structure does not significantly affect the characteristic. From the perspective of network stability, robustness is desirable; however, from the perspective of intervention to exert influence on network behavior, it is undesirable. For Boolean networks, there are two fundamental types of robustness. One type pertains to perturbing the state of the network and the other to perturbing the rule-based structure.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom