مشخصات پژوهش

عنوان	A Zero-one Programming Model for Partial Digest Problem
نوع پژوهش	مقاله چاپ شده
کلیدواژه‌ها	Restriction site mapping, DNA, Zero-one programming.
چکیده	The Partial Digest is a well-studied problem with important applications in physical mapping of DNA molecules. In this paper we present a new point of view to the Partial Digest Problem (PDP). We present a sufficient condition for solution of PDP and formulate the PDP as a linear zero-one programming model, such that any optimal solution of this model will be a solution of PDP.
پژوهشگران	حسن صالحی فتح آبادی (نفر دوم)، رضا ندیمی (نفر اول)