Biomedical subjects

Theodore J Perkins

Publications and source records attributed to Theodore J Perkins.

4 recordsLinked to original sources

PubMed2006

Reverse engineering the gap gene network of Drosophila melanogaster.

A fundamental problem in functional genomics is to determine the structure and dynamics of genetic networks based on expression data. We describe a new strategy for solving this problem and apply it to recently published data on early Drosophila melanogaster development. Our method is orders of magnitude faster than current fitting methods and allows us to fit different types of rules for expressing regulatory relationships. Specifically, we use our approach to fit models using a smooth nonlinear formalism for modeling gene regulation (gene circuits) as well as models using logical rules based on activation and repression thresholds for transcription factors. Our technique also allows us to infer regulatory relationships de novo or to test network structures suggested by the literature. We fit a series of models to test several outstanding questions about gap gene regulation, including regulation of and by hunchback and the role of autoactivation. Based on our modeling results and validation against the experimental literature, we propose a revised network structure for the gap gene system. Interestingly, some relationships in standard textbook models of gap gene regulation appear to be unnecessary for or even inconsistent with the details of gap gene expression during wild-type development.

Animals↗

PubMed2006

A fluctuation method to quantify in vivo fluorescence data.

Quantitative in vivo measurements are essential for developing a predictive understanding of cellular behavior. Here we present a technique that converts observed fluorescence intensities into numbers of molecules. By transiently expressing a fluorescently tagged protein and then following its dilution during growth and division, we observe asymmetric partitioning of fluorescence between daughter cells at each division. Such partition asymmetries are set by the actual numbers of proteins present, and thus provide a means to quantify fluorescence levels. We present a Bayesian algorithm that infers from such data both the fluorescence conversion factor and an estimate of the measurement error. Our algorithm works for arbitrarily sized data sets and handles consistently any missing measurements. We verify the algorithm with extensive simulation and demonstrate its application to experimental data from Escherichia coli. Our technique should provide a quantitative internal calibration to systems biology studies of both synthetic and endogenous cellular networks.

Algorithms↗

PubMed2005

Dynamical properties of model gene networks and implications for the inverse problem.

We study the inverse problem, or the "reverse-engineering" problem, for two abstract models of gene expression dynamics, discrete-time Boolean networks and continuous-time switching networks. Formally, the inverse problem is similar for both types of networks. For each gene, its regulators and its Boolean dynamics function must be identified. However, differences in the dynamical properties of these two types of networks affect the amount of data that is necessary for solving the inverse problem. We derive estimates for the average amounts of time series data required to solve the inverse problem for randomly generated Boolean and continuous-time switching networks. We also derive a lower bound on the amount of data needed that holds for both types of networks. We find that the amount of data required is logarithmic in the number of genes for Boolean networks, matching the general lower bound and previous theory, but are superlinear in the number of genes for continuous-time switching networks. We also find that the amount of data needed scales as 2(K), where K is the number of regulators per gene, rather than 2(2K), as previous theory suggests.

Models, Genetic↗

PubMed2004

Inferring models of gene expression dynamics.

We study the problem of identifying genetic networks in which expression dynamics are modeled by a differential equation that uses logical rules to specify time derivatives. We make three main contributions. First, we describe computationally efficient procedures for identifying the structure and dynamics of such networks from expression time series. Second, we derive predictions for the expected amount of data needed to identify randomly generated networks. Third, if expression values are available for only some of the genes, we show that the structure of the network for these "visible" genes can be identified and that the size and overall complexity of the network can be estimated. We validate these procedures and predictions using simulation experiments based on randomly generated networks with up to 30,000 genes and 17 distinct regulators per gene and on a network that models floral morphogenesis in Arabidopsis thaliana.

Arabidopsis↗