Cargando…
Network subgraph-based approach for analyzing and comparing molecular networks
Molecular networks are built up from genetic elements that exhibit feedback interactions. Here, we studied the problem of measuring the similarity of directed networks by proposing a novel alignment-free approach: the network subgraph-based approach. Our approach does not make use of randomized netw...
Autores principales: | , , , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
PeerJ Inc.
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9074881/ https://www.ncbi.nlm.nih.gov/pubmed/35529499 http://dx.doi.org/10.7717/peerj.13137 |
_version_ | 1784701559366483968 |
---|---|
author | Huang, Chien-Hung Zaenudin, Efendi Tsai, Jeffrey J.P. Kurubanjerdjit, Nilubon Ng, Ka-Lok |
author_facet | Huang, Chien-Hung Zaenudin, Efendi Tsai, Jeffrey J.P. Kurubanjerdjit, Nilubon Ng, Ka-Lok |
author_sort | Huang, Chien-Hung |
collection | PubMed |
description | Molecular networks are built up from genetic elements that exhibit feedback interactions. Here, we studied the problem of measuring the similarity of directed networks by proposing a novel alignment-free approach: the network subgraph-based approach. Our approach does not make use of randomized networks to determine modular patterns embedded in a network, and this method differs from the network motif and graphlet methods. Network similarity was quantified by gauging the difference between the subgraph frequency distributions of two networks using Jensen–Shannon entropy. We applied the subgraph approach to study three types of molecular networks, i.e., cancer networks, signal transduction networks, and cellular process networks, which exhibit diverse molecular functions. We compared the performance of our subgraph detection algorithm with other algorithms, and the results were consistent, but other algorithms could not address the issue of subgraphs/motifs embedded within a subgraph/motif. To evaluate the effectiveness of the subgraph-based method, we applied the method along with the Jensen–Shannon entropy to classify six network models, and it achieves a 100% accuracy of classification. The proposed information-theoretic approach allows us to determine the structural similarity of two networks regardless of node identity and network size. We demonstrated the effectiveness of the subgraph approach to cluster molecular networks that exhibit similar regulatory interaction topologies. As an illustration, our method can identify (i) common subgraph-mediated signal transduction and/or cellular processes in AML and pancreatic cancer, and (ii) scaffold proteins in gastric cancer and hepatocellular carcinoma; thus, the results suggested that there are common regulation modules for cancer formation. We also found that the underlying substructures of the molecular networks are dominated by irreducible subgraphs; this feature is valid for the three classes of molecular networks we studied. The subgraph-based approach provides a systematic scenario for analyzing, compare and classifying molecular networks with diverse functionalities. |
format | Online Article Text |
id | pubmed-9074881 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2022 |
publisher | PeerJ Inc. |
record_format | MEDLINE/PubMed |
spelling | pubmed-90748812022-05-07 Network subgraph-based approach for analyzing and comparing molecular networks Huang, Chien-Hung Zaenudin, Efendi Tsai, Jeffrey J.P. Kurubanjerdjit, Nilubon Ng, Ka-Lok PeerJ Bioinformatics Molecular networks are built up from genetic elements that exhibit feedback interactions. Here, we studied the problem of measuring the similarity of directed networks by proposing a novel alignment-free approach: the network subgraph-based approach. Our approach does not make use of randomized networks to determine modular patterns embedded in a network, and this method differs from the network motif and graphlet methods. Network similarity was quantified by gauging the difference between the subgraph frequency distributions of two networks using Jensen–Shannon entropy. We applied the subgraph approach to study three types of molecular networks, i.e., cancer networks, signal transduction networks, and cellular process networks, which exhibit diverse molecular functions. We compared the performance of our subgraph detection algorithm with other algorithms, and the results were consistent, but other algorithms could not address the issue of subgraphs/motifs embedded within a subgraph/motif. To evaluate the effectiveness of the subgraph-based method, we applied the method along with the Jensen–Shannon entropy to classify six network models, and it achieves a 100% accuracy of classification. The proposed information-theoretic approach allows us to determine the structural similarity of two networks regardless of node identity and network size. We demonstrated the effectiveness of the subgraph approach to cluster molecular networks that exhibit similar regulatory interaction topologies. As an illustration, our method can identify (i) common subgraph-mediated signal transduction and/or cellular processes in AML and pancreatic cancer, and (ii) scaffold proteins in gastric cancer and hepatocellular carcinoma; thus, the results suggested that there are common regulation modules for cancer formation. We also found that the underlying substructures of the molecular networks are dominated by irreducible subgraphs; this feature is valid for the three classes of molecular networks we studied. The subgraph-based approach provides a systematic scenario for analyzing, compare and classifying molecular networks with diverse functionalities. PeerJ Inc. 2022-05-03 /pmc/articles/PMC9074881/ /pubmed/35529499 http://dx.doi.org/10.7717/peerj.13137 Text en ©2022 Huang et al. https://creativecommons.org/licenses/by/4.0/This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0/) , which permits unrestricted use, distribution, reproduction and adaptation in any medium and for any purpose provided that it is properly attributed. For attribution, the original author(s), title, publication source (PeerJ) and either DOI or URL of the article must be cited. |
spellingShingle | Bioinformatics Huang, Chien-Hung Zaenudin, Efendi Tsai, Jeffrey J.P. Kurubanjerdjit, Nilubon Ng, Ka-Lok Network subgraph-based approach for analyzing and comparing molecular networks |
title | Network subgraph-based approach for analyzing and comparing molecular networks |
title_full | Network subgraph-based approach for analyzing and comparing molecular networks |
title_fullStr | Network subgraph-based approach for analyzing and comparing molecular networks |
title_full_unstemmed | Network subgraph-based approach for analyzing and comparing molecular networks |
title_short | Network subgraph-based approach for analyzing and comparing molecular networks |
title_sort | network subgraph-based approach for analyzing and comparing molecular networks |
topic | Bioinformatics |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9074881/ https://www.ncbi.nlm.nih.gov/pubmed/35529499 http://dx.doi.org/10.7717/peerj.13137 |
work_keys_str_mv | AT huangchienhung networksubgraphbasedapproachforanalyzingandcomparingmolecularnetworks AT zaenudinefendi networksubgraphbasedapproachforanalyzingandcomparingmolecularnetworks AT tsaijeffreyjp networksubgraphbasedapproachforanalyzingandcomparingmolecularnetworks AT kurubanjerdjitnilubon networksubgraphbasedapproachforanalyzingandcomparingmolecularnetworks AT ngkalok networksubgraphbasedapproachforanalyzingandcomparingmolecularnetworks |