Enviar búsqueda
Cargar
9 vol4no6
•
0 recomendaciones
•
611 vistas
Saurabh Sharma CrazyFor You
Seguir
Educación
Tecnología
Denunciar
Compartir
Denunciar
Compartir
1 de 4
Descargar ahora
Descargar para leer sin conexión
Recomendados
Parent's letter pt1 2012
Parent's letter pt1 2012
Mdm_Leng
Intro to Game Physics with Box2D Chapter 2 Part 1
Intro to Game Physics with Box2D Chapter 2 Part 1
Ian Parberry
Intro to Game Physics with Box2D Chapter 2 Part 2
Intro to Game Physics with Box2D Chapter 2 Part 2
Ian Parberry
Multiplexer design based on majority gate with quantum cellular automata
Multiplexer design based on majority gate with quantum cellular automata
Neelabh Tiwari
Deg rbn eccs
Deg rbn eccs
roberto_gg
2.4 edited1
2.4 edited1
bangqohar
M6 thai-2551
M6 thai-2551
sivaporn612
All about Mrs. Keane
All about Mrs. Keane
Ashlee Keane
Recomendados
Parent's letter pt1 2012
Parent's letter pt1 2012
Mdm_Leng
Intro to Game Physics with Box2D Chapter 2 Part 1
Intro to Game Physics with Box2D Chapter 2 Part 1
Ian Parberry
Intro to Game Physics with Box2D Chapter 2 Part 2
Intro to Game Physics with Box2D Chapter 2 Part 2
Ian Parberry
Multiplexer design based on majority gate with quantum cellular automata
Multiplexer design based on majority gate with quantum cellular automata
Neelabh Tiwari
Deg rbn eccs
Deg rbn eccs
roberto_gg
2.4 edited1
2.4 edited1
bangqohar
M6 thai-2551
M6 thai-2551
sivaporn612
All about Mrs. Keane
All about Mrs. Keane
Ashlee Keane
L'invio al professionista psi
L'invio al professionista psi
roracaro
La psicoanalisi non è una professione sanitaria
La psicoanalisi non è una professione sanitaria
roracaro
ข้อสอบ
ข้อสอบ
sivaporn612
Republic day celebration in india
Republic day celebration in india
CHHAMA
M6 eng-2551
M6 eng-2551
sivaporn612
Anak, jaminan ke syurga atau ke neraka
Anak, jaminan ke syurga atau ke neraka
Paparazi Sarawak
Siberia
Siberia
Ashlee Keane
Apply etch
Apply etch
Hparisotto
Imprimindo sua própria impressora 3D
Imprimindo sua própria impressora 3D
Cláudio Sampaio
Flour fortification:malnutrition and health effects of whole grains
Flour fortification:malnutrition and health effects of whole grains
Malik Tariq Sarwar Awan
Aqidah islamiyyah
Aqidah islamiyyah
Paparazi Sarawak
ամփոփում
ամփոփում
tatevabrahamyan
Islamic Ruqyah Centre
Islamic Ruqyah Centre
Paparazi Sarawak
World food day
World food day
Malik Tariq Sarwar Awan
Regional Fortification Harmony-Cross border meeting at Kazakhistan
Regional Fortification Harmony-Cross border meeting at Kazakhistan
Malik Tariq Sarwar Awan
Wheat Flour Fortification
Wheat Flour Fortification
Malik Tariq Sarwar Awan
Dna computing
Dna computing
sathish3
DNA computing seminar
DNA computing seminar
Amit Yerva
DNA COMPUTER
DNA COMPUTER
Dhaval Patel
DNA based computer : present & future
DNA based computer : present & future
Kinjal Mondal
Power point presentation of saminer topic DNA based computing
Power point presentation of saminer topic DNA based computing
Paushali Sen
Truncated boolean matrices for dna
Truncated boolean matrices for dna
IJCSEA Journal
Más contenido relacionado
Destacado
L'invio al professionista psi
L'invio al professionista psi
roracaro
La psicoanalisi non è una professione sanitaria
La psicoanalisi non è una professione sanitaria
roracaro
ข้อสอบ
ข้อสอบ
sivaporn612
Republic day celebration in india
Republic day celebration in india
CHHAMA
M6 eng-2551
M6 eng-2551
sivaporn612
Anak, jaminan ke syurga atau ke neraka
Anak, jaminan ke syurga atau ke neraka
Paparazi Sarawak
Siberia
Siberia
Ashlee Keane
Apply etch
Apply etch
Hparisotto
Imprimindo sua própria impressora 3D
Imprimindo sua própria impressora 3D
Cláudio Sampaio
Flour fortification:malnutrition and health effects of whole grains
Flour fortification:malnutrition and health effects of whole grains
Malik Tariq Sarwar Awan
Aqidah islamiyyah
Aqidah islamiyyah
Paparazi Sarawak
ամփոփում
ամփոփում
tatevabrahamyan
Islamic Ruqyah Centre
Islamic Ruqyah Centre
Paparazi Sarawak
World food day
World food day
Malik Tariq Sarwar Awan
Regional Fortification Harmony-Cross border meeting at Kazakhistan
Regional Fortification Harmony-Cross border meeting at Kazakhistan
Malik Tariq Sarwar Awan
Wheat Flour Fortification
Wheat Flour Fortification
Malik Tariq Sarwar Awan
Destacado
(16)
L'invio al professionista psi
L'invio al professionista psi
La psicoanalisi non è una professione sanitaria
La psicoanalisi non è una professione sanitaria
ข้อสอบ
ข้อสอบ
Republic day celebration in india
Republic day celebration in india
M6 eng-2551
M6 eng-2551
Anak, jaminan ke syurga atau ke neraka
Anak, jaminan ke syurga atau ke neraka
Siberia
Siberia
Apply etch
Apply etch
Imprimindo sua própria impressora 3D
Imprimindo sua própria impressora 3D
Flour fortification:malnutrition and health effects of whole grains
Flour fortification:malnutrition and health effects of whole grains
Aqidah islamiyyah
Aqidah islamiyyah
ամփոփում
ամփոփում
Islamic Ruqyah Centre
Islamic Ruqyah Centre
World food day
World food day
Regional Fortification Harmony-Cross border meeting at Kazakhistan
Regional Fortification Harmony-Cross border meeting at Kazakhistan
Wheat Flour Fortification
Wheat Flour Fortification
Similar a 9 vol4no6
Dna computing
Dna computing
sathish3
DNA computing seminar
DNA computing seminar
Amit Yerva
DNA COMPUTER
DNA COMPUTER
Dhaval Patel
DNA based computer : present & future
DNA based computer : present & future
Kinjal Mondal
Power point presentation of saminer topic DNA based computing
Power point presentation of saminer topic DNA based computing
Paushali Sen
Truncated boolean matrices for dna
Truncated boolean matrices for dna
IJCSEA Journal
BioAlg02.ppt
BioAlg02.ppt
VishwakiranYanamandr
Hybrid PSO-SA algorithm for training a Neural Network for Classification
Hybrid PSO-SA algorithm for training a Neural Network for Classification
IJCSEA Journal
A Study on DNA based Computation and Memory Devices
A Study on DNA based Computation and Memory Devices
Editor IJCATR
G0345259
G0345259
IOSR Journals
My 2hr+ survey talk at the Vector Institute, on our deep learning theorems.
My 2hr+ survey talk at the Vector Institute, on our deep learning theorems.
Anirbit Mukherjee
My invited talk at the 2018 Annual Meeting of SIAM (Society of Industrial and...
My invited talk at the 2018 Annual Meeting of SIAM (Society of Industrial and...
Anirbit Mukherjee
SOFT COMPUTERING TECHNICS -Unit 1
SOFT COMPUTERING TECHNICS -Unit 1
sravanthi computers
Boundness of a neural network weights using the notion of a limit of a sequence
Boundness of a neural network weights using the notion of a limit of a sequence
IJDKP
chapter10
chapter10
butest
Truncated Boolean Matrices for DNA Computation
Truncated Boolean Matrices for DNA Computation
IJCSEA Journal
Perceptron
Perceptron
Nagarajan
Quantitative Propagation of Chaos for SGD in Wide Neural Networks
Quantitative Propagation of Chaos for SGD in Wide Neural Networks
Valentin De Bortoli
Bt0080 fundamentals of algorithms2
Bt0080 fundamentals of algorithms2
Techglyphs
Molecular Solutions For The Set-Partition Problem On Dna-Based Computing
Molecular Solutions For The Set-Partition Problem On Dna-Based Computing
ijcsit
Similar a 9 vol4no6
(20)
Dna computing
Dna computing
DNA computing seminar
DNA computing seminar
DNA COMPUTER
DNA COMPUTER
DNA based computer : present & future
DNA based computer : present & future
Power point presentation of saminer topic DNA based computing
Power point presentation of saminer topic DNA based computing
Truncated boolean matrices for dna
Truncated boolean matrices for dna
BioAlg02.ppt
BioAlg02.ppt
Hybrid PSO-SA algorithm for training a Neural Network for Classification
Hybrid PSO-SA algorithm for training a Neural Network for Classification
A Study on DNA based Computation and Memory Devices
A Study on DNA based Computation and Memory Devices
G0345259
G0345259
My 2hr+ survey talk at the Vector Institute, on our deep learning theorems.
My 2hr+ survey talk at the Vector Institute, on our deep learning theorems.
My invited talk at the 2018 Annual Meeting of SIAM (Society of Industrial and...
My invited talk at the 2018 Annual Meeting of SIAM (Society of Industrial and...
SOFT COMPUTERING TECHNICS -Unit 1
SOFT COMPUTERING TECHNICS -Unit 1
Boundness of a neural network weights using the notion of a limit of a sequence
Boundness of a neural network weights using the notion of a limit of a sequence
chapter10
chapter10
Truncated Boolean Matrices for DNA Computation
Truncated Boolean Matrices for DNA Computation
Perceptron
Perceptron
Quantitative Propagation of Chaos for SGD in Wide Neural Networks
Quantitative Propagation of Chaos for SGD in Wide Neural Networks
Bt0080 fundamentals of algorithms2
Bt0080 fundamentals of algorithms2
Molecular Solutions For The Set-Partition Problem On Dna-Based Computing
Molecular Solutions For The Set-Partition Problem On Dna-Based Computing
Último
Food safety_Challenges food safety laboratories_.pdf
Food safety_Challenges food safety laboratories_.pdf
Sherif Taha
Unit-IV; Professional Sales Representative (PSR).pptx
Unit-IV; Professional Sales Representative (PSR).pptx
VishalSingh1417
The basics of sentences session 3pptx.pptx
The basics of sentences session 3pptx.pptx
heathfieldcps1
Explore beautiful and ugly buildings. Mathematics helps us create beautiful d...
Explore beautiful and ugly buildings. Mathematics helps us create beautiful d...
christianmathematics
Basic Civil Engineering first year Notes- Chapter 4 Building.pptx
Basic Civil Engineering first year Notes- Chapter 4 Building.pptx
Denish Jangid
Mehran University Newsletter Vol-X, Issue-I, 2024
Mehran University Newsletter Vol-X, Issue-I, 2024
Mehran University of Engineering & Technology, Jamshoro
Vishram Singh - Textbook of Anatomy Upper Limb and Thorax.. Volume 1 (1).pdf
Vishram Singh - Textbook of Anatomy Upper Limb and Thorax.. Volume 1 (1).pdf
ssuserdda66b
How to Create and Manage Wizard in Odoo 17
How to Create and Manage Wizard in Odoo 17
Celine George
Understanding Accommodations and Modifications
Understanding Accommodations and Modifications
MJDuyan
Dyslexia AI Workshop for Slideshare.pptx
Dyslexia AI Workshop for Slideshare.pptx
callscotland1987
Fostering Friendships - Enhancing Social Bonds in the Classroom
Fostering Friendships - Enhancing Social Bonds in the Classroom
Pooky Knightsmith
Key note speaker Neum_Admir Softic_ENG.pdf
Key note speaker Neum_Admir Softic_ENG.pdf
Admir Softic
Google Gemini An AI Revolution in Education.pptx
Google Gemini An AI Revolution in Education.pptx
Dr. Sarita Anand
Making communications land - Are they received and understood as intended? we...
Making communications land - Are they received and understood as intended? we...
Association for Project Management
Graduate Outcomes Presentation Slides - English
Graduate Outcomes Presentation Slides - English
neillewis46
Salient Features of India constitution especially power and functions
Salient Features of India constitution especially power and functions
KarakKing
Accessible Digital Futures project (20/03/2024)
Accessible Digital Futures project (20/03/2024)
Jisc
1029-Danh muc Sach Giao Khoa khoi 6.pdf
1029-Danh muc Sach Giao Khoa khoi 6.pdf
QucHHunhnh
SKILL OF INTRODUCING THE LESSON MICRO SKILLS.pptx
SKILL OF INTRODUCING THE LESSON MICRO SKILLS.pptx
Amanpreet Kaur
Application orientated numerical on hev.ppt
Application orientated numerical on hev.ppt
RamjanShidvankar
Último
(20)
Food safety_Challenges food safety laboratories_.pdf
Food safety_Challenges food safety laboratories_.pdf
Unit-IV; Professional Sales Representative (PSR).pptx
Unit-IV; Professional Sales Representative (PSR).pptx
The basics of sentences session 3pptx.pptx
The basics of sentences session 3pptx.pptx
Explore beautiful and ugly buildings. Mathematics helps us create beautiful d...
Explore beautiful and ugly buildings. Mathematics helps us create beautiful d...
Basic Civil Engineering first year Notes- Chapter 4 Building.pptx
Basic Civil Engineering first year Notes- Chapter 4 Building.pptx
Mehran University Newsletter Vol-X, Issue-I, 2024
Mehran University Newsletter Vol-X, Issue-I, 2024
Vishram Singh - Textbook of Anatomy Upper Limb and Thorax.. Volume 1 (1).pdf
Vishram Singh - Textbook of Anatomy Upper Limb and Thorax.. Volume 1 (1).pdf
How to Create and Manage Wizard in Odoo 17
How to Create and Manage Wizard in Odoo 17
Understanding Accommodations and Modifications
Understanding Accommodations and Modifications
Dyslexia AI Workshop for Slideshare.pptx
Dyslexia AI Workshop for Slideshare.pptx
Fostering Friendships - Enhancing Social Bonds in the Classroom
Fostering Friendships - Enhancing Social Bonds in the Classroom
Key note speaker Neum_Admir Softic_ENG.pdf
Key note speaker Neum_Admir Softic_ENG.pdf
Google Gemini An AI Revolution in Education.pptx
Google Gemini An AI Revolution in Education.pptx
Making communications land - Are they received and understood as intended? we...
Making communications land - Are they received and understood as intended? we...
Graduate Outcomes Presentation Slides - English
Graduate Outcomes Presentation Slides - English
Salient Features of India constitution especially power and functions
Salient Features of India constitution especially power and functions
Accessible Digital Futures project (20/03/2024)
Accessible Digital Futures project (20/03/2024)
1029-Danh muc Sach Giao Khoa khoi 6.pdf
1029-Danh muc Sach Giao Khoa khoi 6.pdf
SKILL OF INTRODUCING THE LESSON MICRO SKILLS.pptx
SKILL OF INTRODUCING THE LESSON MICRO SKILLS.pptx
Application orientated numerical on hev.ppt
Application orientated numerical on hev.ppt
9 vol4no6
1.
Journal of Theoretical
and Applied Information Technology © 2005 - 2008 JATIT. All rights reserved. www.jatit.org SOLUTION TO THE 0/1 KNAPSACK PROBLEM BASED ON DNA COMPUTING 1 SANCHITA PAUL, 2 ANIRBAN DE SARKAR 1 Lecturer, Computer Science Dept., B.I.T., Mesra, Ranchi – 835215 2 P.G. Student ( M.E., Software Engg), B.I.T., Mesra, Ranchi – 835215 E-mail: 1 sanchita07@gmail.com , 2 anirban_123007@yahoo.co.in ABSTRACT A lot of current research in DNA computing has been directed towards solving hard combinatorial problems. Among them Knapsack problem is one of the most common problems which have been studied intensively in the last decade attracting both theorists and practicians. Fractional Knapsack Problem is easily solvable by greedy strategy, but 0/1 Knapsack Problem is not possible to solve in this method. In this paper we have described a DNA computing model to find the optimal solution of 0/1 Knapsack problem. Here we have used a unique strategy to encode data inside DNA. We have replicated the DNAs and in the later stage took the combination of each and every DNA to form double stranded DNAs in order to find out the optimal solution. This method is a clear evidence for the ability of DNA computing solving hard numerical optimization problems, which is not a very easy work to solve with the help of traditional electronic computers. Keywords: 0/1 Knapsack Problem, DNA Operations, DNA Encoding Method. 1. INTRODUCTION Now, what items should he take? This is called 0/1 Knapsack Problem, because each item must either In 1994, Adleman (from University of Southern he has taken or left behind; the thief can’t take a California) suggested that DNA could be used to fractional amount of an item. solve complex mathematical problems. He solved Just like that suppose that we want to fill up a the Hamiltonian Path Problem (the Traveling knapsack by selecting some objects among various salesman problem) whose solution required finding objects (generally called items). There are n different a path from start to end going through all cities only items available and each item j has a weight of wj once. This experiment demonstrates the feasibility and a profit of pj. The knapsack can hold a weight of of carrying out computations at the molecular level. at most W. The problem is to find an optimal subset He also showed us the potential power of high of items so as to maximize the total profits subject to intensity parallel computation of DNA molecules. the knapsack’s weight capacity. The profits, weights, In this paper we have solved the 0/1 Knapsack and capacities are positive integers. Problem. The proposed approach involves a DNA Let xj be binary variables given as follows: encoding method and some basic biological xj = 1 if item j is selected; operations, which are described in section 3. 0 otherwise. Section 2 introduces us with the 0/1 Knapsack The knapsack problem can be mathematically Problem, in section 4 we have described the formulated as follows: proposed algorithm and the last part section 5 Max ∑ pjxj, here j =1 to n, (conclusion) introduces us with the result and Such that ∑ wjxj ≤ W, here j =1 to n, summary of our work. xj = 1 or 0; j = 1, 2,...., n. This is known as the 0/1 knapsack problem, which 2. 0/1 KNAPSACK PROBLEM is pure integer programming with a single constraint and forms a very important class of Actually there is a story behind this problem. A integer programming. thief was robbing a store and he finds n items, suppose those are I1, I2,..., In. The j th item, Ij is 3. DNA COMPUTING FOR SOLUTION OF worth pj dollars and weights wj pounds, where bj & 0/1 KNAPSACK PROBLEM wj are integers. He wants to take as valuable a load is possible, but he can carry at most W pounds in DNA computing is a form of computing which his knapsack for some integers C. uses DNA (Deoxy Ribonucleic Acid) & 526
2.
Journal of Theoretical
and Applied Information Technology © 2005 - 2008 JATIT. All rights reserved. www.jatit.org biochemistry & molecular biology, instead of 4. PROPOSED DNA ALGORITHM TO traditional silicon based computer technologies. SOLVE 0/1 KNAPSACK PROBLEM DNA is extremely important biological macromolecules as it is used in transfer of genetic According to the 0/1 Knapsack Problem, we information & the synthesis of enzymes (proteins). have Item set I = {I1, I2, I3,…., In}, Profit P = {P1, The basic compositions of DNA include – one P2, P3,…., Pn} and corresponding weights W = phosphate group, one deoxyribose sugar & one {W1, W2, W3, …, Wn}, now we have to choose nitrogenous base. There are 4 kinds of nitrogenous the items in such a way so that we can gain bases – Adenine (A), Guanine (G), Cytosine (C) maximum profit, but the weight of all items should and Thymine (T). DNA is a double helix consisting not cross the Knapsack capacity. In this case, we of two single strand deoxynucleotide chains cannot break any item. running in an antiparallel configuration. To solve this problem we simply take an example Nitrogen base + Sugar = Nucleoside + Phosphate = that we have 3 items, Nucleotide. Item, I = {I1, I2, I3} After determining the precise structure of DNA, Weight, W = {6, 8, 10} many experimental methods have been invented Profit, P = {4, 6, 8} including annealing, amplifying, melting, Now we have to find out the maximum profit. separating, cutting, ligating, and so on, which can Step 1: be used to help discover the mechanisms of DNA ENCODING METHOD: For any item information storage and output. The basic (suppose here we take, for first item I1) i (1≤i≤n) assumptions are that the data can be encoded in we use 2 DNA strands named Si1 and Si2 to DNA strands and are error-free, and that molecular encode it. Suppose Si1 is the longer strand whose biologic technologies can perform all length is Wi, which denotes the weight of that item. computational operations. The models of DNA This Si1 has three parts: - first part (Si1’), center computing are based on different combinations of part (Spi) and last part (Si1’’). We can write it as, the following biological operations on DNA Si1 = Si1’ Spi Si1’’. The center part Spi denotes the strands: profit of that item whose length is Pi. The shorter 1. Melting/annealing: break apart/bond together strand Si2 is the reverse complement of the center two single DNA strands with complementary part of Si1, that is, Si2 = -h (Spi). Thus Si2 sequences. combine with the center part of Si1 to form a 2. Synthesis of a desired DNA strand of polynomial fragment of dsDNA. length. So, Si1’ = ⎣(Wi-Pi)/2⎦ and Si1’’ = Wi-Pi-⎣(Wi- 3. Separation of the strands by length. Pi)/2⎦. 4. Merging: pour two (or more) test tubes into one. Just in the same way for the item 2 and item 3 we 5. Extraction: extract the strands that contain a take the following DNA strands, Sj1 = Sj1’ Spj given pattern as a sub string. Sj1’’ and Sk1 = Sk1’ Spk Sk1’’ as weight of the 6. Amplifying: make copies of DNA strands by other 2 strands; Sj2 = -h (Spj) and Sk2 = -h (Spk) as using the polymerize chain reaction (PCR). the reverse complement of the center part of those 7. Polymerization: transform a single strand that strands. has a portion of double-stranded subsequence into For any two items i, j (1≤i, j≤n) we have to add an an entire double-stranded molecule. extra DNA strand known as additional code (Saij) 8. Cutting: cut DNA strands by using restriction and it will be the reverse complement of the last enzymes. part of Si1 and last part of Sj1, so that Saij = -h 9. Ligation: paste DNA strands with (Si1’’ Sj1’). So we can easily say that additional complementary sticky ends by using ligases. code Sajk = -h (Sj1’’ Sk1’). 10. Marking single strands by hybridization. 11. Destroying the marked strands. Si1’ Spi Si1’’ Sj1’ Spj Sj1’’ Sk1’ Spk Sk1’’ 12. Detection: given a tube, check if it contains at least one DNA strand. 13. Number: given a tube, count many DNA strands in it. 14. Clear: a test tube is denoted by T. Consider a Si2 Saij Sj2 Sajk Sk2 particular bit position ‘‘p’’, the operation logically turns bit position p ‘‘off ’’ (value 0) on every strand Additional codes in tube T. 527
3.
Journal of Theoretical
and Applied Information Technology © 2005 - 2008 JATIT. All rights reserved. www.jatit.org Knapsack Capacity. This step will be done by means of Gel Electrophoresis. Take those DNA strands in different test tubes. Step 7: Then, DETECT (T0): After separating the dsDNAs whose READ (Si1, Si2, Sj1, Sj2, Sk1, Sk2, Saij, Sakj): length is greater than Knapsack Capacity from the Describes those DNA strands, which are taken in test tube T0 we do the detect operation to see the following test tubes T1, T2, T3, T4, T5, T6, T7, whether there are at least one dsDNA or not. T8. If detect operation returns (N) that means all the Step 2: items are above the Knapsack Capacity, if it returns MERGE (T1, T2; T3, T4; T5, T6): In this merge (Y) that means there are at least 1 item that is operation mix the DNA strand from test tubes T2 to within the Knapsack Capacity. T1, T4 to T3 and T6 to T5 to generate the double Step 8: stranded DNAs with the help of center part’s DENATURATION (T0): In this operation we heat reverse complement part of every strand. up the test tube T0 to get single stranded DNA from Step 3: the dsDNA. AMPLIFY (T1, T1’, T1’’), Step 9: AMPLIFY (T3, T3’, T3’’), SEPARATION: All the DNA strands without the AMPLIFY (T5, T5’, T5’’): Amplify each DNA additional code were in the upper portion and those strands 2 times (because item is 3), then we will get strands are discarded by means of separation 4 identical copies of each strand, this is because we operation. have to take different possible combinations to Step 10: generate dsDNAs to choose the highest weight part DELETION: The additional codes are deleted from among all possible combinations. the remaining DNA strands by means of Restriction Step 4: Enzymes. MELT (T1, T1’, T1’’, T2, T2’, T2’’, T3, T3’, T3’’): By heating up all the test tubes (T1,…, T3’’) Sj2 Sajk Sk2 dsDNAs will be converted into single stranded DNAs. Step 5: MERGE (T0, T7, T8, T1,..., T3’’): Now mix all the copies of DNA strands and also the additional code -h (Sj2) -h (Sk2) strands in a test tube T0. As a result of mixing Sj2 Sk2 various double stranded DNAs will be generated randomly according to the Watson-Crick Sakj Complementary law. For every item the shorter DNA strand that denotes the reverse complement of the center part can combine with the center part of the longer DNA Deleted additional code strand to form dsDNAs. For any two items, the DNA strands of encoding In this deletion operation the targeted DNA strand items i, j can combine with the additional code part is suppose given in the figure below. Now we want to form dsDNAs. to delete the additional code of the middle portion If we see in some case there is lowest possibility to named as Sakj. So, at first we have to add the combine 2 single stranded DNAs to form a double reverse complement of another 2 DNA strands in stranded DNA due to the reason of lack of the test tube. Those are –h (Sj2) and -h (Sk2), complementary pairs we ignore them by means of which are reverse complement of strand Sj2 and Pair wise Complementary Alignment technique (In Sk2. After mixing those strands Sj2 and Sk2 this technique, we consider some value such as for combine with their complementary strands and fold mismatch of complementary pairs we assign it as 0, the additional code portion. Then we can easily cut for matching of complementary pairs we assign it that by means of restriction enzymes. as +1 and for gap it will be 0). Step 11: Step 6: SEPARATION BY LENGTH: After deleting SEPARATION BY LENGTH: After getting additional codes those DNA strands go through the randomly generated all dsDNAs we separate the Gel Electrophoresis technique (DNAs are separated dsDNA strands whose length is above the by length) to find the longest DNA strands that stands for the maximum Profit. 528
4.
Journal of Theoretical
and Applied Information Technology © 2005 - 2008 JATIT. All rights reserved. www.jatit.org Step 12: SEQUENCING: Now at the last step we have to do REFERENCES the sequencing of the longest DNA strand to determine its nucleotides sequence, so that we can [1] L. Adleman, Molecular computation of solution easily tell the maximum profit. to combinatorial problems, Science 266 (1994) 1021–1024. Example explained according to the DNA encoding method: [2] W.Y. Chung, P.C. Chih, R.W. Kee, Molecular Item, I = {I1, I2, I3} solutions to the binary integer programming Weight, W = {6, 8, 10} problem based on DNA computing, Biosystem Profit, P = {4, 6, 8} 83 (2005) 56–66. [3] Z. Tiina, Formal models of DNA computing: a Si1’ Spi Si1’’ = W1 = 6 = ATGCAA survey, Proc. Estonian Acad. Sci. Phys. Math. Si2 = P1 = 4 = TGCA 49 (2) (2000) 90–99. Sj1’ Spj Sj1’’ = W2 = 8 = CGAATAGC Sj2 = P2 = 6 = CTATTC [4] L. Adleman, Computing with DNA, Sci. Am. Sk1’ Spk Sk1’’ = W3 = 10 = ATGGCTACGA 279 (1998) 34–40. Sk2 = P3 = 8 = CGTAGCCA [5] Q.H. Liu et al., DNA computing on surfaces, Saij = -h (Si1’’ Sj1’) = -h (AC) = GT Nature 403 (2000) 175–179. Sajk = -h (Sj1’’ Sk1’) = -h (CA) = TG Saik = -h (Si1’’Sk1’) = -h (AA) = TT [6] H.Y. Wu, An improved surface-based method During the time of deletion operation the additional for DNA computing, Biosystem 59 (2001) 1–5. codes will be deleted by the help of restriction enzymes. If we follow the above example, at last [7] L. Wang et al., Surface-based DNA computing we get the following type of combinations such as: operations: DESTROY and READOUT, >> TGCA GT CTATTC, Biosystem 52 (1999) >> CTATTC TG CGTAGCCA. [8] S.P.A. Fodor et al., Light-directed, spatially In the above example the underlined portions are addressable parallel chemical synthesis, Science the additional codes, which will be deleted. After 251 (1991) 767–773 deletion the length of these 2 strands will be 10 and 14, which are the profit parts. Now by gel [9] Faullhammer, D., Cukras, A.R., Lipton, R.J., electrophoresis we choose the highest profit part Landweber, L.F., 2000. Molecular computation: that will be 14 in above example. If we RNA solutions to chess problems. Proc. Natl. mathematically crosscheck the result we can see Acad. Sci. U.S.A. 97, 1385–1389. that the profits can be the followings:– 4, 6, 8, 10, 12 and 14. So, the highest profit is obviously 14. [10] Gillmor, S.D., Rugheimer, P.P., Lagally,M.G., 2002. Computing with DNA on surfaces. Surf. Sci. 500, 699–721. 5. CONCLUSIONS [11] Lipton, R.J., 1995. DNA solution of hard DNA performs millions of operations computational problems. Science 268, 542–545. simultaneously, generates a complete set of potential solutions, conduct large parallel searches and efficiently handle massive amounts of working memory – those are the reasons why the DNA computation has arisen. But still now we have to face many problems during some biological operation, as an example temperature control is not an easy task, moreover there always comes a question of purity when millions of paths are generated and we have to choose the right one among them. So, more research and study is needed in this field. In this article we have highlighted a DNA computing model to solve the 0/1 Knapsack Problem whose time complexity is O (n2) and space complexity is O (2n). 529
Descargar ahora