Answers are grounded in this paper and cite their sources.
A multitude of interaction networks exist between different molecular entities within the intracellular milieu. By representing these interactions as a Boolean network, cell fate can be correlated to singleton attractors, and used to shortlist genes implicated in disease pathology. Detection of these singleton attractors is an NP-hard problem. We report here a sequential subgraph (SSG) algorithm that identifies all singleton attractors of a biological network and reduces the number of computations to do so by several orders of magnitude compared with explicit enumeration (EE) while retaining accuracies. The SSG algorithm deconstructs the biological network into subgraphs of sizes equal to their in-degrees. For each subgraph, the states constituting singleton attractors are computed separately and then stitched together according to a computed sequence to obtain the complete set. We applied this algorithm to determine the attractors of the |γ|-secretase network consisting of 146 vertices and 193 edges, a near impossible task by EE. For this network, we also simulated the effect of gain of function of PSEN1 observed in Alzheimer's patients, and compared the differences in the 550 attractors with those obtained for normal PSEN1 activity. The proteins exhibiting differential activity were segregated and categorized into apoptosis, Ca|²⁺| signalling, amyloidosis, Notch signalling, oxidative stress, MAPK cascade, cell cycle and proliferation clusters. By segregating proteins in this manner from the attractor states, it was possible to elucidate the metabolic impact of PSEN1 mutation in Alzheimer's disease.
No takes yet. Share an insight, caveat, or question.
Vasaikar et al. (2014) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: