کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5520688 | 1544956 | 2016 | 13 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A general resolution of intractable problems in polynomial time through DNA Computing
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
مدلسازی و شبیه سازی
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
Based on a set of known biological operations, a general resolution of intractable problems in polynomial time through DNA Computing is presented. This scheme has been applied to solve two NP-Hard problems (Minimization of Open Stacks Problem and Matrix Bandwidth Minimization Problem) and three co-NP-Complete problems (associated with Hamiltonian Path, Traveling Salesman and Hamiltonian Circuit), which have not been solved with this model. Conclusions and open questions concerning the computational capacity of this model are presented, and research topics are suggested.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Biosystems - Volume 150, December 2016, Pages 119-131
Journal: Biosystems - Volume 150, December 2016, Pages 119-131
نویسندگان
C.A.A. Sanches, N.Y. Soma,