Biological systems are commonly represented using networks consisting of interactions between various elements in the system. Reverse engineering, a method of mathematical modeling, is used to recover how the elements in the biological network are connected. These connections are encoded using wiring diagrams, which are directed graphs that describe how elements in a network affect one another. A signed wiring diagram provides additional information about the interactions between elements relating to activation and inhibition. Due to cost concerns, it is optimal to gain insight into biological networks with as few experiments and data as possible. Minimal wiring diagrams identify the minimal sets of variables for which a model that fits the data exists. Previously established algorithms to compute possible minimal wiring diagrams rely on the primary decomposition of ideals in polynomial rings.
Stanley-Reisner theory provides a one-to-one correspondence between squarefree monomial ideals and abstract simplicial complexes. In this work, we use this correspondence to determine conditions under which a given set of inputs is guaranteed to have a unique signed minimal wiring diagram, regardless of the output assignment.
| Identifer | oai:union.ndltd.org:CALPOLY/oai:digitalcommons.calpoly.edu:theses-4096 |
| Date | 01 June 2022 |
| Creators | Newsome-Slade, Vanessa |
| Publisher | DigitalCommons@CalPoly |
| Source Sets | California Polytechnic State University |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | Master's Theses |
Page generated in 0.0018 seconds