Date of Award

August 2020

Document Type

Thesis

Degree Name

Master of Science (MS)

Department

School of Mathematical and Statistical Sciences

Committee Member

Matthew Macauley

Committee Member

Michael Burr

Committee Member

Svetlana Poznanovikj

Abstract

The network inference problem is a significant problem in systems biology. In this paper, we will describe an approach to this problem involving computational algebra. Specifically, given an unknown Boolean function, we can create a square-free monomial or pseudomonomial ideal whose primary decomposition encodes the possible sets of variables that the function can depend on, and whether those interactions are activations or inhibitions. We apply this problem to time series data generated from a non-linear ODE, built over unknown feed-forward loops, and subject to gene knockouts.

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.