1
|
Somers J, Fenner M, Kong G, Thirumalaisamy D, Yashar WM, Thapa K, Kinali M, Nikolova O, Babur Ö, Demir E. A framework for considering prior information in network-based approaches to omics data analysis. Proteomics 2023; 23:e2200402. [PMID: 37986684 DOI: 10.1002/pmic.202200402] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Grants] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 07/19/2023] [Revised: 09/20/2023] [Accepted: 09/21/2023] [Indexed: 11/22/2023]
Abstract
For decades, molecular biologists have been uncovering the mechanics of biological systems. Efforts to bring their findings together have led to the development of multiple databases and information systems that capture and present pathway information in a computable network format. Concurrently, the advent of modern omics technologies has empowered researchers to systematically profile cellular processes across different modalities. Numerous algorithms, methodologies, and tools have been developed to use prior knowledge networks (PKNs) in the analysis of omics datasets. Interestingly, it has been repeatedly demonstrated that the source of prior knowledge can greatly impact the results of a given analysis. For these methods to be successful it is paramount that their selection of PKNs is amenable to the data type and the computational task they aim to accomplish. Here we present a five-level framework that broadly describes network models in terms of their scope, level of detail, and ability to inform causal predictions. To contextualize this framework, we review a handful of network-based omics analysis methods at each level, while also describing the computational tasks they aim to accomplish.
Collapse
Affiliation(s)
- Julia Somers
- Department of Biomedical Engineering, Oregon Health and Science University, Portland, Oregon, USA
| | - Madeleine Fenner
- Department of Biomedical Engineering, Oregon Health and Science University, Portland, Oregon, USA
| | - Garth Kong
- Department of Biomedical Engineering, Oregon Health and Science University, Portland, Oregon, USA
- Division of Oncological Sciences, Oregon Health and Science University, Portland, Oregon, USA
| | - Dharani Thirumalaisamy
- Department of Biomedical Engineering, Oregon Health and Science University, Portland, Oregon, USA
| | - William M Yashar
- Department of Biomedical Engineering, Oregon Health and Science University, Portland, Oregon, USA
- Division of Oncological Sciences, Oregon Health and Science University, Portland, Oregon, USA
| | - Kisan Thapa
- Computer Science Department, University of Massachusetts Boston, College of Science and Mathematics, Boston, Massachusetts, USA
| | - Meric Kinali
- Computer Science Department, University of Massachusetts Boston, College of Science and Mathematics, Boston, Massachusetts, USA
| | - Olga Nikolova
- Department of Biomedical Engineering, Oregon Health and Science University, Portland, Oregon, USA
- Division of Oncological Sciences, Oregon Health and Science University, Portland, Oregon, USA
| | - Özgün Babur
- Computer Science Department, University of Massachusetts Boston, College of Science and Mathematics, Boston, Massachusetts, USA
| | - Emek Demir
- Department of Biomedical Engineering, Oregon Health and Science University, Portland, Oregon, USA
| |
Collapse
|
2
|
Pušnik Ž, Mraz M, Zimic N, Moškon M. Review and assessment of Boolean approaches for inference of gene regulatory networks. Heliyon 2022; 8:e10222. [PMID: 36033302 PMCID: PMC9403406 DOI: 10.1016/j.heliyon.2022.e10222] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 02/09/2022] [Revised: 04/22/2022] [Accepted: 08/03/2022] [Indexed: 10/25/2022] Open
Abstract
Boolean descriptions of gene regulatory networks can provide an insight into interactions between genes. Boolean networks hold predictive power, are easy to understand, and can be used to simulate the observed networks in different scenarios. We review fundamental and state-of-the-art methods for inference of Boolean networks. We introduce a methodology for a straightforward evaluation of Boolean inference approaches based on the generation of evaluation datasets, application of selected inference methods, and evaluation of performance measures to guide the selection of the best method for a given inference problem. We demonstrate this procedure on inference methods REVEAL (REVerse Engineering ALgorithm), Best-Fit Extension, MIBNI (Mutual Information-based Boolean Network Inference), GABNI (Genetic Algorithm-based Boolean Network Inference) and ATEN (AND/OR Tree ENsemble algorithm), which infers Boolean descriptions of gene regulatory networks from discretised time series data. Boolean inference approaches tend to perform better in terms of dynamic accuracy, and slightly worse in terms of structural correctness. We believe that the proposed methodology and provided guidelines will help researchers to develop Boolean inference approaches with a good predictive capability while maintaining structural correctness and biological relevance.
Collapse
Affiliation(s)
- Žiga Pušnik
- University of Ljubljana, Faculty of Computer and Information Science, Večna pot 113, Ljubljana, SI-1000, Slovenia
| | - Miha Mraz
- University of Ljubljana, Faculty of Computer and Information Science, Večna pot 113, Ljubljana, SI-1000, Slovenia
| | - Nikolaj Zimic
- University of Ljubljana, Faculty of Computer and Information Science, Večna pot 113, Ljubljana, SI-1000, Slovenia
| | - Miha Moškon
- University of Ljubljana, Faculty of Computer and Information Science, Večna pot 113, Ljubljana, SI-1000, Slovenia
| |
Collapse
|
3
|
Suriyalaksh M, Raimondi C, Mains A, Segonds-Pichon A, Mukhtar S, Murdoch S, Aldunate R, Krueger F, Guimerà R, Andrews S, Sales-Pardo M, Casanueva O. Gene regulatory network inference in long-lived C. elegans reveals modular properties that are predictive of novel aging genes. iScience 2022; 25:103663. [PMID: 35036864 PMCID: PMC8753122 DOI: 10.1016/j.isci.2021.103663] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 02/23/2021] [Revised: 09/09/2021] [Accepted: 12/15/2021] [Indexed: 11/24/2022] Open
Abstract
We design a “wisdom-of-the-crowds” GRN inference pipeline and couple it to complex network analysis to understand the organizational principles governing gene regulation in long-lived glp-1/Notch Caenorhabditis elegans. The GRN has three layers (input, core, and output) and is topologically equivalent to bow-tie/hourglass structures prevalent among metabolic networks. To assess the functional importance of structural layers, we screened 80% of regulators and discovered 50 new aging genes, 86% with human orthologues. Genes essential for longevity—including ones involved in insulin-like signaling (ILS)—are at the core, indicating that GRN's structure is predictive of functionality. We used in vivo reporters and a novel functional network covering 5,497 genetic interactions to make mechanistic predictions. We used genetic epistasis to test some of these predictions, uncovering a novel transcriptional regulator, sup-37, that works alongside DAF-16/FOXO. We present a framework with predictive power that can accelerate discovery in C. elegans and potentially humans. Gene-regulatory inference provides global network of long-lived animals The large-scale topology of the network has an hourglass structure Membership to the core of the hourglass is a good predictor of functionality Discovered 50 novel aging genes, including sup-37, a DAF-16 dependent gene
Collapse
Affiliation(s)
| | | | - Abraham Mains
- Babraham Institute, Babraham, Cambridge CB22 3AT, UK
| | | | | | | | - Rebeca Aldunate
- Escuela de Biotecnología, Facultad de Ciencias, Universidad Santo Tomas, Santiago, Chile
| | - Felix Krueger
- Babraham Institute, Babraham, Cambridge CB22 3AT, UK
| | - Roger Guimerà
- ICREA, Barcelona 08010, Catalonia, Spain.,Department of Chemical Engineering, Universitat Rovira i Virgili, Tarragona 43007, Catalonia, Spain
| | - Simon Andrews
- Babraham Institute, Babraham, Cambridge CB22 3AT, UK
| | - Marta Sales-Pardo
- Department of Chemical Engineering, Universitat Rovira i Virgili, Tarragona 43007, Catalonia, Spain
| | | |
Collapse
|
4
|
Zhao M, He W, Tang J, Zou Q, Guo F. A comprehensive overview and critical evaluation of gene regulatory network inference technologies. Brief Bioinform 2021; 22:6128842. [PMID: 33539514 DOI: 10.1093/bib/bbab009] [Citation(s) in RCA: 27] [Impact Index Per Article: 9.0] [Reference Citation Analysis] [Abstract] [Key Words] [Journal Information] [Subscribe] [Scholar Register] [Received: 09/28/2020] [Revised: 12/11/2020] [Accepted: 01/06/2021] [Indexed: 12/12/2022] Open
Abstract
Gene regulatory network (GRN) is the important mechanism of maintaining life process, controlling biochemical reaction and regulating compound level, which plays an important role in various organisms and systems. Reconstructing GRN can help us to understand the molecular mechanism of organisms and to reveal the essential rules of a large number of biological processes and reactions in organisms. Various outstanding network reconstruction algorithms use specific assumptions that affect prediction accuracy, in order to deal with the uncertainty of processing. In order to study why a certain method is more suitable for specific research problem or experimental data, we conduct research from model-based, information-based and machine learning-based method classifications. There are obviously different types of computational tools that can be generated to distinguish GRNs. Furthermore, we discuss several classical, representative and latest methods in each category to analyze core ideas, general steps, characteristics, etc. We compare the performance of state-of-the-art GRN reconstruction technologies on simulated networks and real networks under different scaling conditions. Through standardized performance metrics and common benchmarks, we quantitatively evaluate the stability of various methods and the sensitivity of the same algorithm applying to different scaling networks. The aim of this study is to explore the most appropriate method for a specific GRN, which helps biologists and medical scientists in discovering potential drug targets and identifying cancer biomarkers.
Collapse
Affiliation(s)
- Mengyuan Zhao
- School of Computer Science and Technology, College of Intelligence and Computing, Tianjin University, Tianjin, China
| | - Wenying He
- School of Computer Science and Technology, College of Intelligence and Computing, Tianjin University, Tianjin, China
| | - Jijun Tang
- University of South Carolina, Tianjin, China
| | - Quan Zou
- Institute of Fundamental and Frontier Sciences, University of Electronic Science and Technology of China, Chengdu, China
| | - Fei Guo
- School of Computer Science and Technology, College of Intelligence and Computing, Tianjin University, Tianjin, China
| |
Collapse
|
5
|
García RA, Martí AC, Cabeza C, Rubido N. Small-worldness favours network inference in synthetic neural networks. Sci Rep 2020; 10:2296. [PMID: 32042036 PMCID: PMC7010800 DOI: 10.1038/s41598-020-59198-7] [Citation(s) in RCA: 4] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 09/10/2019] [Accepted: 11/28/2019] [Indexed: 12/15/2022] Open
Abstract
A main goal in the analysis of a complex system is to infer its underlying network structure from time-series observations of its behaviour. The inference process is often done by using bi-variate similarity measures, such as the cross-correlation (CC) or mutual information (MI), however, the main factors favouring or hindering its success are still puzzling. Here, we use synthetic neuron models in order to reveal the main topological properties that frustrate or facilitate inferring the underlying network from CC measurements. Specifically, we use pulse-coupled Izhikevich neurons connected as in the Caenorhabditis elegans neural networks as well as in networks with similar randomness and small-worldness. We analyse the effectiveness and robustness of the inference process under different observations and collective dynamics, contrasting the results obtained from using membrane potentials and inter-spike interval time-series. We find that overall, small-worldness favours network inference and degree heterogeneity hinders it. In particular, success rates in C. elegans networks – that combine small-world properties with degree heterogeneity – are closer to success rates in Erdös-Rényi network models rather than those in Watts-Strogatz network models. These results are relevant to understand better the relationship between topological properties and function in different neural networks.
Collapse
Affiliation(s)
- Rodrigo A García
- Universidad de la República, Instituto de Física de Facultad de Ciencias, Montevideo, 11400, Uruguay.
| | - Arturo C Martí
- Universidad de la República, Instituto de Física de Facultad de Ciencias, Montevideo, 11400, Uruguay
| | - Cecilia Cabeza
- Universidad de la República, Instituto de Física de Facultad de Ciencias, Montevideo, 11400, Uruguay
| | - Nicolás Rubido
- Universidad de la República, Instituto de Física de Facultad de Ciencias, Montevideo, 11400, Uruguay
| |
Collapse
|
6
|
Dominietto M, Pica A, Safai S, Lomax AJ, Weber DC, Capobianco E. Role of Complex Networks for Integrating Medical Images and Radiomic Features of Intracranial Ependymoma Patients in Response to Proton Radiotherapy. Front Med (Lausanne) 2020; 6:333. [PMID: 32010703 PMCID: PMC6978687 DOI: 10.3389/fmed.2019.00333] [Citation(s) in RCA: 6] [Impact Index Per Article: 1.5] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 05/15/2019] [Accepted: 12/23/2019] [Indexed: 12/21/2022] Open
Abstract
Human cancers exhibit phenotypic diversity that medical imaging can precisely and non-invasively detect. Multiple factors underlying innovations and progresses in the medical imaging field exert diagnostic and therapeutic impacts. The emerging field of radiomics has shown unprecedented ability to use imaging information in guiding clinical decisions. To achieve clinical assessment that exploits radiomic knowledge sources, integration between diverse data types is required. A current gap is the accuracy with which radiomics aligns with clinical endpoints. We propose a novel methodological approach that synergizes data volumes (images), tissue-contextualized information breadth, and network-driven resolution depth. Following the Precision Medicine paradigm, disease monitoring and prognostic assessment are tackled at the individual level by examining medical images acquired from two patients affected by intracranial ependymoma (with and without relapse). The challenge of spatially characterizing intratumor heterogeneity is tackled by a network approach that presents two main advantages: (a) Increased detection in the image domain power from high spatial resolution, (b) Superior accuracy in generating hypotheses underlying clinical decisions.
Collapse
Affiliation(s)
- Marco Dominietto
- Center for Proton Therapy, Paul Scherrer Institute, Villigen, Switzerland.,Radiation Oncology Department, University Hospital of Bern, Bern, Switzerland
| | - Alessia Pica
- Center for Proton Therapy, Paul Scherrer Institute, Villigen, Switzerland
| | - Sairos Safai
- Center for Proton Therapy, Paul Scherrer Institute, Villigen, Switzerland
| | - Antony J Lomax
- Center for Proton Therapy, Paul Scherrer Institute, Villigen, Switzerland
| | - Damien C Weber
- Center for Proton Therapy, Paul Scherrer Institute, Villigen, Switzerland.,Radiation Oncology Department, University Hospital of Bern, Bern, Switzerland
| | - Enrico Capobianco
- Center for Computational Science, University of Miami, Coral Gables, FL, United States
| |
Collapse
|