دانلود رایگان ترجمه مقاله محاسبه DNA و کاربرد آن (نشریه اسپرینگر ۲۰۰۸) (ترجمه رایگان – برنزی ⭐️)
این مقاله انگلیسی ISI در نشریه اسپرینگر در ۲۳ صفحه در سال ۲۰۰۸ منتشر شده و ترجمه آن ۱۶ صفحه میباشد. کیفیت ترجمه این مقاله رایگان – برنزی ⭐️ بوده و به صورت ناقص ترجمه شده است.
دانلود رایگان مقاله انگلیسی + خرید ترجمه فارسی | |
عنوان فارسی مقاله: |
محاسبه DNA و کاربرد آن |
عنوان انگلیسی مقاله: |
DNA Computing and its Application |
|
مشخصات مقاله انگلیسی (PDF) | |
سال انتشار | ۲۰۰۸ |
تعداد صفحات مقاله انگلیسی | ۲۳ صفحه با فرمت pdf |
رشته های مرتبط با این مقاله | مهندسی کامپیوتر |
گرایش های مرتبط با این مقاله | هوش مصنوعی و رایانش ابری |
چاپ شده در مجله (ژورنال) | هوش محاسباتی: یک جمع بندی – Computational Intelligence: A Compendium |
رفرنس | دارد ✓ |
کد محصول | F1535 |
نشریه | اسپرینگر – Springer |
مشخصات و وضعیت ترجمه فارسی این مقاله | |
وضعیت ترجمه | انجام شده و آماده دانلود |
تعداد صفحات ترجمه تایپ شده با فرمت ورد با قابلیت ویرایش | ۱۶ صفحه (۲ صفحه رفرنس انگلیسی) با فونت ۱۴ B Nazanin |
ترجمه عناوین تصاویر و جداول | ترجمه شده است ✓ |
ترجمه متون داخل تصاویر | ترجمه نشده است ☓ |
ترجمه متون داخل جداول | ترجمه نشده است ☓ |
درج تصاویر در فایل ترجمه | درج شده است ✓ |
درج جداول در فایل ترجمه | درج شده است ✓ |
کیفیت ترجمه | کیفیت ترجمه این مقاله پایین میباشد |
توضیحات | ترجمه این مقاله به صورت ناقص انجام شده است. |
فهرست مطالب |
۱ مقدمه |
بخشی از ترجمه |
۱- مقدمه |
بخشی از مقاله انگلیسی |
۱ Introduction The objectives of this chapter are twofold: firstly to introduce DNA computation, and secondly to demonstrate how DNA computing can be applied to solve large, complex combinatorial problems, such as the optimal scheduling of a group of elevators servicing a number of floors in a multi-storey building. Recently, molecular (or wet) computing has been widely researched not only within the context of solving NP-complete/NP-hard problems that are the most difficult problems in NP, but also implementation by way of digital (silicon-based) computers [21]. We commence with a description of the basic concepts of ‘wet computation’, then present recent results for the efficient management of a group of elevators.
۲ DNA Computing The main idea behind DNA computing is to adopt a biological (wet) technique as an efficient computing vehicle, where data are represented using strands of DNA. Even though a DNA reaction is much slower than the cycle time of a silicon-based computer, the inherently parallel processing offered by the DNA process plays an important role. This massive parallelism of DNA processing is of particular interest in solving NP-complete or NP-hard problems. It is not uncommon to encounter molecular biological experiments which involve 6 × ۱۰۱۶/ml of DNA molecules. This means that we can effectively realize 60,000 TeraBytes of memory, assuming that each string of a DNA molecule expresses one character. The total execution speed of a DNA computer can outshine that of a conventional electronic computer, even though the execution time of a single DNA molecule reaction is relatively slow. A DNA computer is thus suited to problems such as the analysis of genome information, and the functional design of molecules (where molecules constitute the input data). DNA consists of four bases of molecule structure, named adenine (A), guanine (G), cytosine (C) and thymine (T). Moreover, constraints apply to connections between these bases: more specifically, A can connect only with T, and G only with C – this connecting rule is referred to as ‘Watson-Crick complementarity’. This property is essential to realize the separate operation (discussed later). In other words, it is possible to separate a partial string of characters ‘ad’ so that a DNA sequence complementary to the DNA denoting ‘ad’ is marked, input into a test tube, hybridized to form a double strand helix of DNA, then abstracted. Further, this property enables us to randomly create a set of character strings according to some rule. Since [1] described a method for solving a directed Hamiltonian path problem with 7 cities using DNA molecules, researchers have pursued theoretical studies to realize general computation using DNA molecules [for example, [23]. [2] has developed a computational model to realize – via experimental treatment of DNA molecules – operations on multiple sets of character strings, following the encoding of finite alphabet characters onto DNA molecules. As previously mentioned, DNA molecules can be used as information storage media. Usually, DNA sequences of around 8-20 base-pairs are used to represent bits, and numerous methods have been developed to manipulate and evaluate these. In order to manipulate a wet technology to perform computations, one or more of the following techniques are used as computational operators for copying, sorting, splitting or concatenating the information contained within DNA molecules: • ligation, • hybridization, • polymerase chain reaction (PCR), • gel electrophoresis, and • enzyme reaction. In the following subsection we briefly describe the specific bio-chemical process which serves as the basis of our DNA computing approach. A DNA computer performs wet computation based on the high ability of special molecule recognition executed in reactions among DNA molecules. Molecular computation was first reported in [1], where it was found that a DNA polymerase – which incorporates an enzyme function for copying DNA – is very similar in function to that of a Turing machine. DNA polymerase composes its complementary DNA molecule using a single strand helix of a DNA molecule as a mold. On the basis of this characteristic, if a large amount of DNA molecules are mixed in a test tube, then reactions among them occur simultaneously. Therefore, when a DNA molecule representing data or code reacts with other DNA molecules, this corresponds to superparallel processing and/or a huge amount of memory in comparison with a conventional (electronic) computer. |
دانلود رایگان مقاله انگلیسی + خرید ترجمه فارسی | |
عنوان فارسی مقاله: |
محاسبه DNA و کاربرد آن |
عنوان انگلیسی مقاله: |
DNA Computing and its Application |
|