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

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

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 realistic dynamical system models of gene regulatory and metabolic networks. The goal of the compu...

متن کامل

A Method for Solving Optimal Control Problems Using Genetic Programming

This paper deals with a novel method for solving optimal control problems based on genetic programming. This approach produces some trial solutions and seeks the best of them. If the solution cannot be expressed in a closed analytical form then our method produces an approximation with a controlled level of accuracy. Using numerical examples, we will demonstrate how to use the results.

متن کامل

Optimal Decompression Through Multi-parametric Nonlinear Programming ★

Recently, a comprehensive dynamic mathematical model named Copernicus has been established to discover the mechanism of the vascular bubble formation and growth during and after decompression from a dive. The model uses Venous Gas Emboli (VGE) as a measurement and connects it to the risk of severe Decompression Sickness (DCS). Being validated by a series of diving tests, Copernicus model is bel...

متن کامل

Generalized Uniformly Optimal Methods for Nonlinear Programming

In this paper, we present a generic framework to extend existing uniformly optimal convex programming algorithms to solve more general nonlinear, possibly nonconvex, optimization problems. The basic idea is to incorporate a local search step (gradient descent or Quasi-Newton iteration) into these uniformly optimal convex programming methods, and then enforce a monotone decreasing property of th...

متن کامل

Interactive Fuzzy Programming for Multi-level Nonlinear Integer Programming Problems through Genetic Algorithms

In the present paper, we focus on multi-level nonlinear integer programming problems (MLNLIPPs) in which there exist decision makers (DMs) with integer decision variables at all levels. Various approaches for multi-level programming problems could exist according to situations which the DMs are placed in. Assuming the cooperative relationship among the DMs at all levels, in this paper, an inter...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: PLoS ONE

سال: 2010

ISSN: 1932-6203

DOI: 10.1371/journal.pone.0009331