Loading...
Publication
CANA v1.0.0: efficient quantification of canalization in automata networks
| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| 1.39 MB | Adobe PDF |
Advisor(s)
Abstract(s)
SUMMARY: The biomolecular networks underpinning cell function exhibit canalization, or the buffering of fluctuations required to function in a noisy environment. We present a new major release of CANA, v1.0.0, an open-source Python package for understanding canalization in automata network models, discrete dynamical systems in which activation of biomolecular entities (e.g. transcription of genes) is modeled as the activity of coupled automata. One understudied putative mechanism for canalization is the functional equivalence of biomolecular regulators (e.g. among the transcription factors for a gene). We study this mechanism using the theory of symmetry in discrete functions. We present a new exact method, schematodes, for finding maximal symmetry groups among the inputs to discrete functions, and integrate it into CANA. The schematodes method substantially outperforms the inexact method of previous CANA versions both in speed and accuracy. We apply CANA v1.0.0 to study symmetry in 74 experimentally supported automata network models from the Cell Collective (CC) repository. The symmetry distribution is significantly different in the CC than in random automata with the same in-degree (connectivity) and bias (average output) (Kolmogorov-Smirnov test, P???.001). Its spread is much wider than in a null model (IQR 0.31 versus IQR 0.20 with equal medians), demonstrating that the CC is enriched in functions with extreme symmetry or asymmetry.
Description
Keywords
Pedagogical Context
Citation
Marcus, A. M., Rozum, J., Sizek, H., & Rocha, L. M. (2025). CANA v1.0.0: efficient quantification of canalization in automata networks. Bioinformatics (Oxford, England), 41(10), Article btaf461. https://doi.org/10.1093/bioinformatics/btaf461