4.6 Article

Quasifibrations of graphs to find symmetries and reconstruct biological networks

出版社

IOP Publishing Ltd
DOI: 10.1088/1742-5468/ac99d1

关键词

bioinformatics; computational biology; information processing; systems biology

资金

  1. NIBIB
  2. NIMH through the NIH BRAIN Initiative Grant [R01 EB028157]
  3. NIH-NCI [R01CA247910]
  4. NSF [DMR-1945909]
  5. EU Project Fine-Grained Analysis of Software Ecosystem as Networks [H2020-ICT-2018-2020]

向作者/读者索取更多资源

Graph fibrations are useful tools to uncover symmetries and cluster synchronization in biological networks, but the incompleteness and disordered nature of biological data make it challenging to apply the traditional definition and algorithms. This paper introduces the theory of quasifibrations to capture quasi-symmetry in such networks and provides an algorithmic solution for finding quasifibrations in networks with missing links and variability across samples. The algorithm is tested using real connectome data and synthetic networks, and it can help researchers find hidden symmetries in unknown or partially known networks, particularly in biological networks.
A fibration of graphs is a homomorphism that is a local isomorphism of in-neighborhoods. Recently, it has been shown that graph fibrations are useful tools to uncover symmetries and cluster synchronization in biological networks ranging from gene, protein, and metabolic networks to the brain. However, the inherent incompleteness and disordered nature of biological data preclude the application of the definition of fibration as it is. As a consequence, also the currently known algorithms to identify fibrations fail in these domains. In this paper, we introduce and develop systematically the theory of quasifibrations which attempts to capture more realistic patterns of quasi-symmetry in such networks. We provide an algorithmic solution to the problem of finding quasifibrations in networks where the existence of missing links and variability across samples preclude the identification of perfect fibration symmetries. We test our algorithm against other strategies to repair missing links in incomplete networks using real connectome data and synthetic networks. Quasifibrations can be applied to reconstruct any incomplete network structure characterized by underlying symmetrical and almost symmetrical clusters. The most direct application of our algorithms is that of helping researchers to find hidden symmetries in unknown (or partially unknown) networks, especially (but not exclusively) of biological nature.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据