An improvement dna computing approach using heuristic techniques

مقدم أطروحة جامعية

Abd Allah, Hasanayn Samir

الجامعة

الجامعة التكنولوجية

الكلية

-

القسم الأكاديمي

قسم علوم الحاسوب

دولة الجامعة

العراق

الدرجة العلمية

دكتوراه

تاريخ الدرجة العلمية

2008

الملخص الإنجليزي

The Search is inherent to the problem and methods of Artificial Intelligence; this is because Al problems are intrinsically complex Efforts to solve problems with computers which human can routinely innate cognitive abilities, path finding, perception and experience, invariably must turn to considerations of search DNA computing, also known as molecular computing, is basically a collection of specially selected DNA strands whose combinations will result in the solution to some problem, depending on the pro6&m at hand, technology is currently available Both to select the initial strands and to fitter the find solution.

CCa4ska % heuristic search means rule of thumb.

In heuristic search, generally it has been used one or more heuristic junctions to determine the better candidate states among a set of legal states that could be generated from astute.

A heuristic is a technique that improves the efficiency of a search process, possibly by sacrificing claims of completeness search algorithm's performance with in four ways completeness, optimality time complexity and space complexly proposed system is based on the idea that titled the system as Heuristic Computing Algorithm.

2 Ke idea suggests to ended the heuristic search in Rm search algorithm so to it more efficient and fickle, we can Benefice from the domestic search properties to improve the void the Of computing algorithm to get the same results that appear when the computing algorithm is run alone, but in less run time required and reduce the space area of the computer memory that required to implement the algorithm, the proposed system is constructed to improve the work of the DNA computing algorithm and enhance the measurement criteria of it 6y reducing the run time and the memory capacity as well as the number of generated random solutions (strands states) that are needed to implement the computing algorithm.

Qe prove that the proposed system with worrisomely, it is contend very important matter to test it with several applications.

Applications (we chatted each one a case testing) that wen selected are the following : 1- Direct Hamiltonian Path Problem (HPR).

2- the Traveling Salesman problem (TSP).

3- The Finding Shortest Path problem (SHPP).

4- the Routing with Minimum Cost (RMCP).

Each case testing wit Be processed in four parts of the proposed system ; the DNA approach part, the DNA with Alpha Beta Pruning approach part, the DNA with Approach part HFNA (DNA + Alpha (Beta Pruning A*)approach main part.

The results of these appfaations appealed that HDNA approach is the best one of that approaches in time comply and space complexity.

التخصصات الرئيسية

الأحياء
تكنولوجيا المعلومات وعلم الحاسوب

الموضوعات

• الذكاء الاصطناعي
• أساليب المحاكاة
• الأحماض النووية
• معالجة البيانات
• الآلات المنطقية
• هندسة الإلكترونيات الحيوية

• APA
• MLA
• AMA

لغة النص

الإنجليزية

نوع البيانات

رسائل جامعية

رقم السجل

BIM-305127