{"title":"On Networks and their Applications: Stability of Gene Regulatory Networks and Gene Function Prediction using Autoencoders","authors":"Hamza Coban","doi":"arxiv-2408.07064","DOIUrl":null,"url":null,"abstract":"We prove that nested canalizing functions are the minimum-sensitivity Boolean\nfunctions for any activity ratio and we determine the functional form of this\nboundary which has a nontrivial fractal structure. We further observe that the\nmajority of the gene regulatory functions found in known biological networks\n(submitted to the Cell Collective database) lie on the line of minimum\nsensitivity which paradoxically remains largely in the unstable regime. Our\nresults provide a quantitative basis for the argument that an evolutionary\npreference for nested canalizing functions in gene regulation (e.g., for higher\nrobustness) and for elasticity of gene activity are sufficient for\nconcentration of such systems near the \"edge of chaos.\" The original structure\nof gene regulatory networks is unknown due to the undiscovered functions of\nsome genes. Most gene function discovery approaches make use of unsupervised\nclustering or classification methods that discover and exploit patterns in gene\nexpression profiles. However, existing knowledge in the field derives from\nmultiple and diverse sources. Incorporating this know-how for novel gene\nfunction prediction can, therefore, be expected to improve such predictions. We\nhere propose a function-specific novel gene discovery tool that uses a\nsemi-supervised autoencoder. Our method is thus able to address the needs of a\nmodern researcher whose expertise is typically confined to a specific\nfunctional domain. Lastly, the dynamics of unorthodox learning approaches like\nbiologically plausible learning algorithms are investigated and found to\nexhibit a general form of Einstein relation.","PeriodicalId":501325,"journal":{"name":"arXiv - QuanBio - Molecular Networks","volume":"54 38 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - QuanBio - Molecular Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2408.07064","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We prove that nested canalizing functions are the minimum-sensitivity Boolean
functions for any activity ratio and we determine the functional form of this
boundary which has a nontrivial fractal structure. We further observe that the
majority of the gene regulatory functions found in known biological networks
(submitted to the Cell Collective database) lie on the line of minimum
sensitivity which paradoxically remains largely in the unstable regime. Our
results provide a quantitative basis for the argument that an evolutionary
preference for nested canalizing functions in gene regulation (e.g., for higher
robustness) and for elasticity of gene activity are sufficient for
concentration of such systems near the "edge of chaos." The original structure
of gene regulatory networks is unknown due to the undiscovered functions of
some genes. Most gene function discovery approaches make use of unsupervised
clustering or classification methods that discover and exploit patterns in gene
expression profiles. However, existing knowledge in the field derives from
multiple and diverse sources. Incorporating this know-how for novel gene
function prediction can, therefore, be expected to improve such predictions. We
here propose a function-specific novel gene discovery tool that uses a
semi-supervised autoencoder. Our method is thus able to address the needs of a
modern researcher whose expertise is typically confined to a specific
functional domain. Lastly, the dynamics of unorthodox learning approaches like
biologically plausible learning algorithms are investigated and found to
exhibit a general form of Einstein relation.