1
|
Zhang Y, Wang M, Wang Z, Liu Y, Xiong S, Zou Q. MetaSEM: Gene Regulatory Network Inference from Single-Cell RNA Data by Meta-Learning. Int J Mol Sci 2023; 24:ijms24032595. [PMID: 36768917 PMCID: PMC9916710 DOI: 10.3390/ijms24032595] [Citation(s) in RCA: 3] [Impact Index Per Article: 3.0] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 11/11/2022] [Revised: 01/23/2023] [Accepted: 01/26/2023] [Indexed: 01/31/2023] Open
Abstract
Regulators in gene regulatory networks (GRNs) are crucial for identifying cell states. However, GRN inference based on scRNA-seq data has several problems, including high dimensionality and sparsity, and requires more label data. Therefore, we propose a meta-learning GRN inference framework to identify regulatory factors. Specifically, meta-learning solves the parameter optimization problem caused by high-dimensional sparse data features. In addition, a few-shot solution was used to solve the problem of lack of label data. A structural equation model (SEM) was embedded in the model to identify important regulators. We integrated the parameter optimization strategy into the bi-level optimization to extract the feature consistent with GRN reasoning. This unique design makes our model robust to small-scale data. By studying the GRN inference task, we confirmed that the selected regulators were closely related to gene expression specificity. We further analyzed the GRN inferred to find the important regulators in cell type identification. Extensive experimental results showed that our model effectively captured the regulator in single-cell GRN inference. Finally, the visualization results verified the importance of the selected regulators for cell type recognition.
Collapse
Affiliation(s)
- Yongqing Zhang
- School of Computer Science, Chengdu University of Information Technology, Chengdu 610225, China
| | - Maocheng Wang
- School of Computer Science, Chengdu University of Information Technology, Chengdu 610225, China
| | - Zixuan Wang
- School of Computer Science, Chengdu University of Information Technology, Chengdu 610225, China
| | - Yuhang Liu
- School of Computer Science, Chengdu University of Information Technology, Chengdu 610225, China
| | - Shuwen Xiong
- School of Computer Science, Chengdu University of Information Technology, Chengdu 610225, China
| | - Quan Zou
- Institute of Fundamental and Frontier Sciences, University of Electronic Science and Technology of China, Chengdu 610051, China
- Correspondence:
| |
Collapse
|
2
|
Abdel-Basset M, Mohamed R, Jameel M, Abouhawwash M. Nutcracker optimizer: A novel nature-inspired metaheuristic algorithm for global optimization and engineering design problems. Knowl Based Syst 2023. [DOI: 10.1016/j.knosys.2022.110248] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 01/04/2023]
|
3
|
Biswas S, Clawson W, Levin M. Learning in Transcriptional Network Models: Computational Discovery of Pathway-Level Memory and Effective Interventions. Int J Mol Sci 2022; 24:ijms24010285. [PMID: 36613729 PMCID: PMC9820177 DOI: 10.3390/ijms24010285] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 10/01/2022] [Revised: 11/23/2022] [Accepted: 12/20/2022] [Indexed: 12/28/2022] Open
Abstract
Trainability, in any substrate, refers to the ability to change future behavior based on past experiences. An understanding of such capacity within biological cells and tissues would enable a particularly powerful set of methods for prediction and control of their behavior through specific patterns of stimuli. This top-down mode of control (as an alternative to bottom-up modification of hardware) has been extensively exploited by computer science and the behavioral sciences; in biology however, it is usually reserved for organism-level behavior in animals with brains, such as training animals towards a desired response. Exciting work in the field of basal cognition has begun to reveal degrees and forms of unconventional memory in non-neural tissues and even in subcellular biochemical dynamics. Here, we characterize biological gene regulatory circuit models and protein pathways and find them capable of several different kinds of memory. We extend prior results on learning in binary transcriptional networks to continuous models and identify specific interventions (regimes of stimulation, as opposed to network rewiring) that abolish undesirable network behavior such as drug pharmacoresistance and drug sensitization. We also explore the stability of created memories by assessing their long-term behavior and find that most memories do not decay over long time periods. Additionally, we find that the memory properties are quite robust to noise; surprisingly, in many cases noise actually increases memory potential. We examine various network properties associated with these behaviors and find that no one network property is indicative of memory. Random networks do not show similar memory behavior as models of biological processes, indicating that generic network dynamics are not solely responsible for trainability. Rational control of dynamic pathway function using stimuli derived from computational models opens the door to empirical studies of proto-cognitive capacities in unconventional embodiments and suggests numerous possible applications in biomedicine, where behavior shaping of pathway responses stand as a potential alternative to gene therapy.
Collapse
Affiliation(s)
- Surama Biswas
- Allen Discovery Center, Tufts University, Medford, MA 02155, USA
- Department of Computer Science & Engineering and Information Technology, Meghnad Saha Institute of Technology, Kolkata 700150, India
| | - Wesley Clawson
- Allen Discovery Center, Tufts University, Medford, MA 02155, USA
| | - Michael Levin
- Allen Discovery Center, Tufts University, Medford, MA 02155, USA
- Wyss Institute for Biologically Inspired Engineering, Harvard University, Boston, MA 02115, USA
- Correspondence: ; Tel.: +1-617-627-6161
| |
Collapse
|
4
|
Elitist random swapped particle swarm optimization embedded with variable k-nearest neighbour classification: a new PSO variant applied to gene identification. Soft comput 2022. [DOI: 10.1007/s00500-022-07515-9] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/10/2022]
|
5
|
Abramson CI, Levin M. Behaviorist approaches to investigating memory and learning: A primer for synthetic biology and bioengineering. Commun Integr Biol 2021; 14:230-247. [PMID: 34925687 PMCID: PMC8677006 DOI: 10.1080/19420889.2021.2005863] [Citation(s) in RCA: 11] [Impact Index Per Article: 3.7] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 12/04/2022] Open
Abstract
The fields of developmental biology, biomedicine, and artificial life are being revolutionized by advances in synthetic morphology. The next phase of synthetic biology and bioengineering is resulting in the construction of novel organisms (biobots), which exhibit not only morphogenesis and physiology but functional behavior. It is now essential to begin to characterize the behavioral capacity of novel living constructs in terms of their ability to make decisions, form memories, learn from experience, and anticipate future stimuli. These synthetic organisms are highly diverse, and often do not resemble familiar model systems used in behavioral science. Thus, they represent an important context in which to begin to unify and standardize vocabulary and techniques across developmental biology, behavioral ecology, and neuroscience. To facilitate the study of behavior in novel living systems, we present a primer on techniques from the behaviorist tradition that can be used to probe the functions of any organism – natural, chimeric, or synthetic – regardless of the details of their construction or origin. These techniques provide a rich toolkit for advancing the fields of synthetic bioengineering, evolutionary developmental biology, basal cognition, exobiology, and robotics.
Collapse
Affiliation(s)
- Charles I Abramson
- Department of Psychology, Laboratory of Comparative Psychology and Behavioral Biology at Oklahoma State University, United States of America
| | - Michael Levin
- Department of Biology, Allen Discovery Center at Tufts University, United States of America
| |
Collapse
|
6
|
Biswas S, Acharyya S. Multi-objective Simulated Annealing Variants to Infer Gene Regulatory Network: A Comparative Study. IEEE/ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 2021; 18:2612-2623. [PMID: 32386161 DOI: 10.1109/tcbb.2020.2992304] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/11/2023]
Abstract
Gene Regulatory Network (GRN) is formed due to mutual transcriptional regulation within a set of protein coding genes in cellular context of an organism. Computational inference of GRN is important to understand the behavior of each gene in terms of change in its protein production rate (expression level). As Recurrent Neural Network (RNN) is efficient in GRN modeling, a bi-objective RNN formulation has been applied here. Based on Archived Multi Objective Simulated Annealing (AMOSA), four algorithms, namely, AMOSA Revised (AMOSAR), Modified Freezing based AMOSA (AMOFSA), Tabu based AMOSA (AMOTSA) and Modified Freezing and Tabu based AMOSA (AMOFTSA) have been proposed and applied to RNN (treated as GRN) for parameter learning taking four gene expression time series datasets. Comparative studies on the performance of the algorithms (based on each dataset) have been made in terms of the number of GRNs obtained in the final non-dominated front and the performance metrics, namely, recall, precision and f1 score. Two proposed variants, namely, AMOFSA and AMOTSA have been found competitive in performance. Experimental observations and statistical analysis show that, modified algorithms are better than AMOSAR and the state-of-the-art algorithms in respect of the above-mentioned metrics.
Collapse
|
7
|
Khan A, Saha G, Pal RK. Modified Half-System Based Method for Reverse Engineering of Gene Regulatory Networks. IEEE/ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 2020; 17:1303-1316. [PMID: 30640623 DOI: 10.1109/tcbb.2019.2892450] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/09/2023]
Abstract
The accurate reconstruction of gene regulatory networks for proper understanding of the intricacies of complex biological mechanisms still provides motivation for researchers. Due to accessibility of various gene expression data, we can now attempt to computationally infer genetic interactions. Among the established network inference techniques, S-system is preferred because of its efficiency in replicating biological systems though it is computationally more expensive. This provides motivation for us to develop a similar system with lesser computational load. In this work, we have proposed a novel methodology for reverse engineering of gene regulatory networks based on a new technique: half-system. Half-systems use half the number of parameters compared to S-systems and thus significantly reduce the computational complexity. We have implemented our proposed technique for reconstructing four benchmark networks from their corresponding temporal expression profiles: an 8-gene, a 10-gene, and two 20-gene networks. Being a new technique, to the best of our knowledge, there are no comparable results for this in the contemporary literature. Therefore, we have compared our results with those obtained from the contemporary literature using other methodologies, including the state-of-the-art method, GENIE3. The results obtained in this work stack favourably against the competition, even showing quantifiable improvements in some cases.
Collapse
|
8
|
Computational methods for Gene Regulatory Networks reconstruction and analysis: A review. Artif Intell Med 2019; 95:133-145. [DOI: 10.1016/j.artmed.2018.10.006] [Citation(s) in RCA: 71] [Impact Index Per Article: 14.2] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 06/21/2018] [Revised: 10/23/2018] [Accepted: 10/23/2018] [Indexed: 01/14/2023]
|
9
|
Jana B, Mitra S, Acharyya S. Repository and Mutation based Particle Swarm Optimization (RMPSO): A new PSO variant applied to reconstruction of Gene Regulatory Network. Appl Soft Comput 2019. [DOI: 10.1016/j.asoc.2018.09.027] [Citation(s) in RCA: 34] [Impact Index Per Article: 6.8] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 12/25/2022]
|
10
|
Raza K. Fuzzy logic based approaches for gene regulatory network inference. Artif Intell Med 2018; 97:189-203. [PMID: 30573378 DOI: 10.1016/j.artmed.2018.12.004] [Citation(s) in RCA: 18] [Impact Index Per Article: 3.0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 05/07/2018] [Revised: 12/10/2018] [Accepted: 12/12/2018] [Indexed: 12/26/2022]
Abstract
The rapid advancements in high-throughput techniques have fueled large-scale production of biological data at very affordable costs. Some of these techniques are microarrays and next-generation sequencing that provide genome level insight of living cells. As a result, the size of most of the biological databases, such as NCBI-GEO, NCBI-SRA, etc., is growing exponentially. These biological data are analyzed using various computational techniques for knowledge discovery - which is also one of the objectives of bioinformatics research. Gene regulatory network (GRN) is a gene-gene interaction network which plays a pivotal role in understanding gene regulation processes and disease mechanism at the molecular level. From last couple of decades, researchers are interested in developing computational algorithms for GRN inference (GRNI) from high-throughput experimental data. Several computational approaches have been proposed for inferring GRN from gene expression data including statistical techniques (correlation coefficient), information theory (mutual information), regression-based approaches, probabilistic approaches (Bayesian networks, naïve byes), artificial neural networks and fuzzy logic. The fuzzy logic, along with its hybridization with other intelligent approaches, is a well-studied technique in GRNI due to its several advantages. In this paper, we present a consolidated review on fuzzy logic and its hybrid approaches developed during last two decades for GRNI.
Collapse
Affiliation(s)
- Khalid Raza
- Department of Computer Science, Jamia Millia Islamia, New Delhi, India.
| |
Collapse
|
11
|
Abbaszadeh O, Khanteymoori AR, Azarpeyvand A. Parallel Algorithms for Inferring Gene Regulatory Networks: A Review. Curr Genomics 2018; 19:603-614. [PMID: 30386172 PMCID: PMC6194435 DOI: 10.2174/1389202919666180601081718] [Citation(s) in RCA: 3] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 12/18/2017] [Revised: 02/20/2018] [Accepted: 05/22/2018] [Indexed: 11/22/2022] Open
Abstract
System biology problems such as whole-genome network construction from large-scale gene expression data are sophisticated and time-consuming. Therefore, using sequential algorithms are not feasible to obtain a solution in an acceptable amount of time. Today, by using massively parallel computing, it is possible to infer large-scale gene regulatory networks. Recently, establishing gene regulatory networks from large-scale datasets have drawn the noticeable attention of researchers in the field of parallel computing and system biology. In this paper, we attempt to provide a more detailed overview of the recent parallel algorithms for constructing gene regulatory networks. Firstly, fundamentals of gene regulatory networks inference and large-scale datasets challenges are given. Secondly, a detailed description of the four parallel frameworks and libraries including CUDA, OpenMP, MPI, and Hadoop is discussed. Thirdly, parallel algorithms are reviewed. Finally, some conclusions and guidelines for parallel reverse engineering are described.
Collapse
Affiliation(s)
- Omid Abbaszadeh
- Department of Electrical and Computer Engineering, University of Zanjan, Zanjan, Iran
| | - Ali Reza Khanteymoori
- Department of Electrical and Computer Engineering, University of Zanjan, Zanjan, Iran
| | - Ali Azarpeyvand
- Department of Electrical and Computer Engineering, University of Zanjan, Zanjan, Iran
| |
Collapse
|
12
|
Biswas S, Acharyya S. A Bi-Objective RNN Model to Reconstruct Gene Regulatory Network: A Modified Multi-Objective Simulated Annealing Approach. IEEE/ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 2018; 15:2053-2059. [PMID: 29990170 DOI: 10.1109/tcbb.2017.2771360] [Citation(s) in RCA: 6] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/08/2023]
Abstract
Gene Regulatory Network (GRN) is a virtual network in a cellular context of an organism, comprising a set of genes and their internal relationships to regulate protein production rate (gene expression level) of each other through coded proteins. Computational Reconstruction of GRN from gene expression data is a widely-applied research area. Recurrent Neural Network (RNN) is a useful modeling scheme for GRN reconstruction. In this research, the RNN formulation of GRN reconstruction having single objective function has been modified to incorporate a new objective function. An existing multi-objective meta-heuristic algorithm, called Archived Multi Objective Simulated Annealing (AMOSA), has been modified and applied to this bi-objective RNN formulation. Executing the resulting algorithm (called AMOSA-GRN) on a gene expression dataset, a collection (termed as Archive) of non-dominated GRNs has been obtained. Ensemble averaging has been applied on the archives, and obtained through a sequence of executions of AMOSA-GRN. Accuracy of GRNs in the averaged archive, with respect to gold standard GRN, varies in the range 0.875 - 1.0 (87.5 - 100 percent).
Collapse
|
13
|
Biswas S, Dutta S, Acharyya S. Identification of Disease Critical Genes Using Collective Meta-heuristic Approaches: An Application to Preeclampsia. Interdiscip Sci 2017; 11:444-459. [PMID: 29196984 DOI: 10.1007/s12539-017-0276-x] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.1] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 01/06/2017] [Revised: 11/06/2017] [Accepted: 11/21/2017] [Indexed: 10/18/2022]
Abstract
Identifying a small subset of disease critical genes out of a large size of microarray gene expression data is a challenge in computational life sciences. This paper has applied four meta-heuristic algorithms, namely, honey bee mating optimization (HBMO), harmony search (HS), differential evolution (DE) and genetic algorithm (basic version GA) to find disease critical genes of preeclampsia which affects women during gestation. Two hybrid algorithms, namely, HBMO-kNN and HS-kNN have been newly proposed here where kNN (k nearest neighbor classifier) is used for sample classification. Performances of these new approaches have been compared with other two hybrid algorithms, namely, DE-kNN and SGA-kNN. Three datasets of different sizes have been used. In a dataset, the set of genes found common in the output of each algorithm is considered here as disease critical genes. In different datasets, the percentage of classification or classification accuracy of meta-heuristic algorithms varied between 92.46 and 100%. HBMO-kNN has the best performance (99.64-100%) in almost all data sets. DE-kNN secures the second position (99.42-100%). Disease critical genes obtained here match with clinically revealed preeclampsia genes to a large extent.
Collapse
Affiliation(s)
- Surama Biswas
- Department of Computer Science and Engineering, Maulana Abul Kalam Azad University of Technology, West Bengal (MAKAUT, WB), BF-142, Sector-I, Salt Lake, Kolkata, West Bengal, 700064, India.
| | - Subarna Dutta
- Department of Computer Science and Engineering, Maulana Abul Kalam Azad University of Technology, West Bengal (MAKAUT, WB), BF-142, Sector-I, Salt Lake, Kolkata, West Bengal, 700064, India
| | - Sriyankar Acharyya
- Department of Computer Science and Engineering, Maulana Abul Kalam Azad University of Technology, West Bengal (MAKAUT, WB), BF-142, Sector-I, Salt Lake, Kolkata, West Bengal, 700064, India
| |
Collapse
|