Cargando…

Optimal In Silico Target Gene Deletion through Nonlinear Programming for Genetic Engineering

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...

Descripción completa

Detalles Bibliográficos
Autores principales: Hong, Chung-Chien, Song, Mingzhou
Formato: Texto
Lenguaje:English
Publicado: Public Library of Science 2010
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2827548/
https://www.ncbi.nlm.nih.gov/pubmed/20195367
http://dx.doi.org/10.1371/journal.pone.0009331
_version_ 1782177962641063936
author Hong, Chung-Chien
Song, Mingzhou
author_facet Hong, Chung-Chien
Song, Mingzhou
author_sort Hong, Chung-Chien
collection PubMed
description 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. METHODOLOGY/PRINCIPAL FINDINGS: 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. SIGNIFICANCE: 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.
format Text
id pubmed-2827548
institution National Center for Biotechnology Information
language English
publishDate 2010
publisher Public Library of Science
record_format MEDLINE/PubMed
spelling pubmed-28275482010-03-02 Optimal In Silico Target Gene Deletion through Nonlinear Programming for Genetic Engineering Hong, Chung-Chien Song, Mingzhou PLoS One Research Article 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. METHODOLOGY/PRINCIPAL FINDINGS: 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. SIGNIFICANCE: 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. Public Library of Science 2010-02-24 /pmc/articles/PMC2827548/ /pubmed/20195367 http://dx.doi.org/10.1371/journal.pone.0009331 Text en Hong, Song. http://creativecommons.org/licenses/by/4.0/ This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are properly credited.
spellingShingle Research Article
Hong, Chung-Chien
Song, Mingzhou
Optimal In Silico Target Gene Deletion through Nonlinear Programming for Genetic Engineering
title Optimal In Silico Target Gene Deletion through Nonlinear Programming for Genetic Engineering
title_full Optimal In Silico Target Gene Deletion through Nonlinear Programming for Genetic Engineering
title_fullStr Optimal In Silico Target Gene Deletion through Nonlinear Programming for Genetic Engineering
title_full_unstemmed Optimal In Silico Target Gene Deletion through Nonlinear Programming for Genetic Engineering
title_short Optimal In Silico Target Gene Deletion through Nonlinear Programming for Genetic Engineering
title_sort optimal in silico target gene deletion through nonlinear programming for genetic engineering
topic Research Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2827548/
https://www.ncbi.nlm.nih.gov/pubmed/20195367
http://dx.doi.org/10.1371/journal.pone.0009331
work_keys_str_mv AT hongchungchien optimalinsilicotargetgenedeletionthroughnonlinearprogrammingforgeneticengineering
AT songmingzhou optimalinsilicotargetgenedeletionthroughnonlinearprogrammingforgeneticengineering