CANA v1.0.0 and schematodes: efficient quantification of symmetry in Boolean automata
Austin M. Marcus, Jordan Rozum, Herbert Sizek, and Luis M. Rocha

TL;DR
This paper introduces CANA v1.0.0 and schematodes, a new efficient algorithm and Python package for analyzing symmetry in Boolean automata, improving speed and accuracy over previous methods and revealing symmetry properties in biological networks.
Contribution
The paper presents a novel exact algorithm for identifying maximal symmetry groups in Boolean functions, integrated into the CANA library with the schematodes package, enhancing analysis of biomolecular network symmetry.
Findings
schematodes outperforms previous methods in speed and accuracy
symmetry distribution in biological networks differs significantly from random models
biomolecular networks show enrichment in functions with extreme symmetry or asymmetry
Abstract
The biomolecular networks underpinning cell function exhibit canalization, or the buffering of fluctuations required to function in a noisy environment. One understudied putative mechanism for canalization is the functional equivalence of a biomolecular entity's regulators (e.g., among the transcription factors for a gene). In these discrete dynamical systems, activation and inhibition of biomolecular entities (e.g., transcription of genes) are modeled as the activity of coupled 2-state automata, and thus the equivalence of regulators can be studied using the theory of symmetry in discrete functions. To this end, we present a new exact algorithm for finding maximal symmetry groups among the inputs to discrete functions. We implement this algorithm in Rust as a Python package, schematodes. We include schematodes in the new CANA v1.0.0 release, an open source Python library for analyzing…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Logic, programming, and type systems · Algorithms and Data Compression
MethodsSPEED: Separable Pyramidal Pooling EncodEr-Decoder for Real-Time Monocular Depth Estimation on Low-Resource Settings · Lib
