(494a) A Mathematical Programming Network Model for Gene Pathway Analysis Conference: AIChE Annual MeetingYear: 2005Proceeding: 2005 AIChE Annual MeetingGroup: Computational Molecular Science and Engineering ForumSession: Computational and Functional Genomics Time: Thursday, November 3, 2005 - 12:30pm-12:46pm Authors: Gupta, R. R., University of Connecticut Storrs Achenie, L. E., University of Connecticut The human genome project was completed in the year 2003; however there are still many genes in the genome whose functions are not known. A method for identifying the possible functions of these uncharacterized genes is by comparing their expression patterns (for example through DNA microarray technology) with known genes. DNA microarray technology has the ability to measure the expression levels of thousands of genes in a single experiment. In addition to gene function, for a known bio-molecular system it is interesting to investigate the possible effects of perturbing various components, which define the cellular mechanism. This leads to many potential applications in medicine and molecular biology especially in the identification of metabolic pathways, complex genetic diseases, drug discovery and toxicology analysis. In this work we propose a procedure for predicting gene expression from a single microarray experiment using a network model that takes into account the inherent reaction engineering and time delay factor. Next we embed the network model in a linear programming framework in order to simulate a genetic network. This helps in correctly identifying the group of genes that effect each other's expression and regulate genetic pathways. We note that most network models (Spellman, 1998; Akutsu, et al., 2000; Dasika et al., 2004, D'haeseleer, 2000; D'haeseleer, 1999, Marnellos and Mjolsness, 1998; Marnellos et al. 2000) provide insights to the regulatory and other biological behavior but they do not take into account the inherent reaction engineering and time delay factor. The proposed linear programming model employs a clustering algorithm (Garg et al., 2002). The idea is primarily based on a modified form of the Boolean network and Pearson's correlation. The pair wise correlation obtained for the set of gene clusters yields the initial set of connection strength (weight matrix) among the clusters. The complete model contains linear ordinary differential equations, which represent the kinetics. We investigated the differentiation of gene expression of early bone cell using data from the University of Connecticut Medical School. The study investigated the time evolution of gene and preliminary results show that the experimental results from the network model compare very well with the data obtained from microarray analysis. From the preliminary results, we have shown and expect that this model would be appropriate in situations where either there is a paucity of experimental data or experiments cannot be performed. References: 1. Marnellos, G., and Mjolsness, E. (1998) Pac. Symp. Biocomput. 5, 30-41. 2. Marnellos, G., Deblandre, G. A., Mjolsness, E., and Kintner, C. (2000) Pac. Symp. Biocomput. 12, 329-340. 3. Akutsu, T. and S. Miyano. Pac. Symp. Biocomput., 2000. 5: p. 290-301. 4. D'haeseleer, P. (2000) Reconstructing Gene Networks from Large Scale Gene Expression Data. Ph.D. dissertation, University of New Mexico. 5. D'haeseleer, P., Wen, X., Fuhrman, S., and Somogyi, R. (1999) Linear Modeling of mRNA expression levels during CNS development and injury. Pac. Symp. Biocomput., 99, 41-52. 6. Dasika, M.S., Gupta, A. and Maranas, C.D. (2004) Pac. Symp. Biocomput., 9, 474-485. 7. Garg, S., Hansen, M. F., Rowe, D. W., and Achenie, L. E. K. (2003) An adaptive strategy for single and multi cluster gene assignment, Biotechnol. Prog., 19, 1142-1148. 8. Spellman. (1998) Mol. Biol. Cell, 9, 3273-3297.