p-adic GRN Suite is a scientific software tool for analyzing Boolean gene regulatory networks (GRNs) using p-adic ultrametric geometry. Given a GRN's discrete transition table, the suite classifies each p-adic ball as Expanding, Attracting, or Indifferent, computes the stability measure μE, finds the optimal gene ordering π* that minimizes instability, and provides interactive visualization of the fractal ball structure, functional transition graph, and algebraic normal form (ANF) polynomial decomposition. The methodology applies to any finite discrete dynamical system with p-adic encoding.
- E/A/I ball classification at all resolution levels
- Stability measure μE with optimal ordering π*
- Functional transition graph with cycle detection
- ANF polynomial analysis via Möbius transform over 𝔽₂ᴺ
- Algebraic structure detection (identities, symmetries, OR gates)
- Exhaustive, genetic algorithm & branch-and-bound search
- Animated fractal ball visualization with level rotation
- Custom GRN input via CSV (bit-vector or decimal format)
| Organism | N genes | p | States | μE(π*) |
|---|---|---|---|---|
| A. thaliana — flowering network | 13 | 2 | 8 192 | 26 776 |
| C. elegans — cell cycle network | 8 | 2 | 256 | 956 |
| D. melanogaster — gap gene network | 6 | 2 | 64 | 64 |
| Custom network (CSV upload) | 2–20 | 2–4 | — | computed |
If you use this software in your research, please cite both the paper and the software using the DOI as identifier. Source code is not publicly distributed; for licensing or collaboration contact the authors.
Note. The DOI above identifies the work for academic citation purposes only. The codebase itself is proprietary and is not publicly distributed from this page. For licensing, custom analysis of networks, or research collaboration, please contact rogelio.perez@cimat.mx.