MOTIVATION: It is a challenging problem in systems biology to infer both the network structure and dynamics of a gene regulatory network from steady-state gene expression data. Some methods based on Boolean or differential equation models have been proposed but they were not efficient in inference of large-scale networks. Therefore, it is necessary to develop a method to infer the network structure and dynamics accurately on large-scale networks using steady-state expression. RESULTS: In this study, we propose a novel constrained genetic algorithm-based Boolean network inference (CGA-BNI) method where a Boolean canalyzing update rule scheme was employed to capture coarse-grained dynamics. Given steady-state gene expression data as an input, CGA-BNI identifies a set of path consistency-based constraints by comparing the gene expression level between the wild-type and the mutant experiments. It then searches Boolean networks which satisfy the constraints and induce attractors most similar to steady-state expressions. We devised a heuristic mutation operation for faster convergence and implemented a parallel evaluation routine for execution time reduction. Through extensive simulations on the artificial and the real gene expression datasets, CGA-BNI showed better performance than four other existing methods in terms of both structural and dynamics prediction accuracies. Taken together, CGA-BNI is a promising tool to predict both the structure and the dynamics of a gene regulatory network when a highest accuracy is needed at the cost of sacrificing the execution time. AVAILABILITY AND IMPLEMENTATION: Source code and data are freely available at https://github.com/csclab/CGA-BNI. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

MOTIVATION: Biological networks are composed of molecular components and their interactions represented by nodes and edges, respectively, in a graph model. Based on this model, there were many studies with respect to effects of node-based mutations on the network dynamics, whereas little attention was paid to edgetic mutations so far. RESULTS: In this paper, we defined an edgetic sensitivity measure that quantifies how likely a converging attractor is changed by edge-removal mutations in a Boolean network model. Through extensive simulations based on that measure, we found interesting properties of highly sensitive edges in both random and real signaling networks. First, the sensitive edges in random networks tend to link two end nodes both of which are susceptible to node-knockout mutations. Interestingly, it was analogous to an observation that the sensitive edges in human signaling networks are likely to connect drug-target genes. We further observed that the edgetic sensitivity predicted drug-targets better than the node-based sensitivity. In addition, the sensitive edges showed distinguished structural characteristics such as a lower connectivity, more involving feedback loops and a higher betweenness. Moreover, their gene-ontology enrichments were clearly different from the other edges. We also observed that genes incident to the highly sensitive interactions are more central by forming a considerably large connected component in human signaling networks. Finally, we validated our approach by showing that most sensitive interactions are promising edgetic drug-targets in p53 cancer and T-cell apoptosis networks. Taken together, the edgetic sensitivity is valuable to understand the complex dynamics of signaling networks. CONTACT: [email protected] SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.