Evaluating Gene Regulatory Network Activity From Dynamic Expression Data by Regularized Constraint Programming

2022 
By extracting molecular interactions identified by experiments, gene regulatory networks or gene circuits have documented in a large number of knowledge-based repositories. They provide systematic information and guidance of the functional connections between regulators, e.g., transcription factor proteins and miRNAs, and target genes. Network activity is defined as the degree of consistency between a regulatory network architecture and a specific cellular context of gene expression and can also be measured as a score of statistical significance. The gene network activities are closely related to the dynamics of cell states. To evaluate the activity of regulatory events in the form of network, we propose a network activity evaluation (NAE) framework by measuring the consistency between network architecture and gene expression data across specific states based on mathematical programming. NAE firstly employs the dynamic Bayesian network model to formulate the network structure with time series profiling data. For the constraints of prior knowledge about gene regulatory network, NAE introduces an interpretable general loss function with regularization penalties to calculate the degree of consistency between gene network and gene expression data. Moreover, we design a fast and convergent alternating direction method of multipliers algorithm to optimize the regularized constraint programming. The efficiency and advantage of the NAE framework is deduced through numerous experiments and comparison studies. It reflects the possibility and potential of the match between network and data, thereby helping to reveal the network activity and to explain the dynamic responds underlying the network structure caused by changes in molecular environment of living cells. The code of NAE is freely available for academic use ( https://github.com/zpliulab/NAE ).
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    46
    References
    0
    Citations
    NaN
    KQI
    []