کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4634613 | 1340696 | 2008 | 15 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A DNA-based solution to the graph isomorphism problem using Adleman-Lipton model with stickers
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A DNA-based solution to the graph isomorphism problem using Adleman-Lipton model with stickers A DNA-based solution to the graph isomorphism problem using Adleman-Lipton model with stickers](/preview/png/4634613.png)
چکیده انگلیسی
Since the experimental demonstration of its feasibility, DNA-based computing has been applied to a number of decision or combinatorial optimization problems. The graph isomorphism problem belongs to the class of NP problems, and has been conjectured intractable, although probably not NP-complete. In this paper, we demonstrate the power of DNA-based computing by showing the graph isomorphism problem can be efficiently solved under this computation model. By generating the solution space using stickers, we present DNA-based algorithms to solve the problem using polynomial number of basic biological operations.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 197, Issue 2, 1 April 2008, Pages 672-686
Journal: Applied Mathematics and Computation - Volume 197, Issue 2, 1 April 2008, Pages 672-686
نویسندگان
Sun-Yuan Hsieh, Ming-Yu Chen,