Evidence map›Paper›PMID 20195367›Full record

ArticlePloS one2010

Optimal in silico target gene deletion through nonlinear programming for genetic engineering.

Chung-Chien Hong, Mingzhou Song

Abstract read
In one paragraph

Article in PloS one, 2010. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

2 authors.

Chung-Chien HongDepartment of Computer Science, New Mexico State University, Las Cruces, New Mexico, United States of America.
Mingzhou Song

Funding

Undergraduate Student Training in Cancer ResearchU54CA132383 · NCI · NEW MEXICO STATE UNIVERSITY LAS CRUCES · PI MICHELE Irene SHUSTER · 2007 to 2026
$21.4M
NCI NIH HHS 5U54CA132383NCI NIH HHS U54 CA132383
6 · The paper itself

Abstract

backgroundOptimal 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

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

Indexed as

AlgorithmsGene DeletionComputational BiologyGene Regulatory NetworksGenetic EngineeringMetabolic Networks and PathwaysModels, GeneticPheromonesProteinsReproducibility of ResultsSaccharomyces cerevisiaeSaccharomyces cerevisiae ProteinsSignal TransductionSoftwarePheromonesProteinsSaccharomyces cerevisiae Proteins

Identifiers

PMID20195367
PMCPMC2827548

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.