A Continuous Optimization Model for Partial Digest Problem
نویسنده
چکیده مقاله:
The pupose of this paper is modeling of Partial Digest Problem (PDP) as a mathematical programming problem. In this paper we present a new viewpoint of PDP. We formulate the PDP as a continuous optimization problem and develope a method to solve this problem. Finally we constract a linear programming model for the problem with an additional constraint. This later model can be solved by the simplex method in which a restricted basis-entry-rule is defined.
منابع مشابه
a continuous optimization model for partial digest problem
the pupose of this paper is modeling of partial digest problem (pdp) as a mathematical programming problem. in this paper we present a new viewpoint of pdp. we formulate the pdp as a continuous optimization problem and develope a method to solve this problem. finally we constract a linear programming model for the problem with an additional constraint. this later model can be solved by the simp...
متن کاملModeling of Partial Digest Problem as a Network flows problem
Restriction Site Mapping is one of the interesting tasks in Computational Biology. A DNA strand can be thought of as a string on the letters A, T, C, and G. When a particular restriction enzyme is added to a DNA solution, the DNA is cut at particular restriction sites. The goal of the restriction site mapping is to determine the location of every site for a given enzyme. In partial digest metho...
متن کاملCombinatorial optimization in DNA mapping - a computational thread of the Simplified Partial Digest Problem
In the paper, the problem of the genome mapping of DNA molecules, is presented. In particular, the new approach — the Simplified Partial Digest Problem (SPDP), is analyzed. This approach, although easy in laboratory implementation and robust with respect to measurement errors, when formulated in terms of a combinatorial search problem, is proved to be strongly NP-hard for the general errorfree ...
متن کاملThe Simplified Partial Digest Problem: Hardness and a Probabilistic Analysis
Introduction We study the problem of genome mapping using restriction site analysis. In restriction site analysis, an enzyme cuts a target DNA strand into DNA fragments, and these DNA fragments are used to reconstruct the restriction site locations of the enzyme. Two common approaches are the Double Digest Problem and the Partial Digest Problem. The Double Digest Problem is known to be NP-Compl...
متن کاملThe simplified partial digest problem: Approximation and a graph-theoretic model
The goal of the Simplified Partial Digest Problem (SPDP) is motivated by the reconstruction of the linear structure of a DNA chain with respect to a given nucleotide pattern, based on the multiset of distances between the adjacent patterns (interpoint distances) and the multiset of distances between each pattern and the two unlabeled endpoints of the DNA chain (end distances). We consider optim...
متن کاملNoisy Data Make the Partial Digest Problem NP - hardTECHNICAL
The Partial Digest problem { well-known for its applications in computational biology and for the intriguingly open status of its computational complexity { asks for the coordinates of n points on a line such that the pairwise distances of the points form a given multi-set of ? n 2 distances. In an eeort to model real-life data, we study the computational complexity of a minimization version of...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 21 شماره 2
صفحات -
تاریخ انتشار 2010-06-01
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023