title: Optimal in silico target gene deletion through nonlinear programming for genetic engineering.
abstract: BACKGROUND
  Optimal selection of multiple regulatory genes, known as targets, for deletion to enhance or suppress the activities of downstream genes or metabolites is an important problem in genetic engineering. Such problems become more feasible to address in silico due to the availability of more realistic dynamical system models of gene regulatory and metabolic networks. The goal of the computational problem is to search for a subset of genes to knock out so that the activity of a downstream gene or a metabolite is optimized.
  
  
  RESULTS
  Based on discrete dynamical system modeling of gene regulatory networks, an integer programming problem is formulated for the optimal in silico target gene deletion problem. In the first result, the integer programming problem is proved to be NP-hard and equivalent to a nonlinear programming problem. In the second result, a heuristic algorithm, called GKONP, is designed to approximate the optimal solution, involving an approach to prune insignificant terms in the objective function, and the parallel differential evolution algorithm. In the third result, the effectiveness of the GKONP algorithm is demonstrated by applying it to a discrete dynamical system model of the yeast pheromone pathways. The empirical accuracy and time efficiency are assessed in comparison to an optimal, but exhaustive search strategy.
  
  
  CONCLUSIONS
  Although the in silico target gene deletion problem has enormous potential applications in genetic engineering, one must overcome the computational challenge due to its NP-hardness. The presented solution, which has been demonstrated to approximate the optimal solution in a practical amount of time, is among the few that address the computational challenge. In the experiment on the yeast pheromone pathways, the identified best subset of genes for deletion showed advantage over genes that were selected empirically. Once validated in vivo, the optimal target genes are expected to achieve higher genetic engineering effectiveness than a trial-and-error procedure.
authors.affiliation: Department of Computer Science, New Mexico State University, Las Cruces, New Mexico, United States of America.
authors.forename: Chung-Chien
authors.initials: CC
authors.lastname: Hong
authors.forename: Mingzhou
authors.initials: M
authors.lastname: Song
mesh_terms: D000465:Algorithms; D019295:Computational Biology / Q000379:methods*; D017353:Gene Deletion; D053263:Gene Regulatory Networks; D005818:Genetic Engineering / Q000379:methods*; D053858:Metabolic Networks and Pathways; D008957:Models, Genetic; D010675:Pheromones / Q000378:metabolism; D011506:Proteins / Q000235:genetics / Q000378:metabolism; D015203:Reproducibility of Results; D012441:Saccharomyces cerevisiae / Q000235:genetics / Q000378:metabolism; D029701:Saccharomyces cerevisiae Proteins / Q000235:genetics / Q000378:metabolism; D015398:Signal Transduction; D012984:Software
chemical_list: D010675:Pheromones; D011506:Proteins; D029701:Saccharomyces cerevisiae Proteins