:Analyzing Complexity for NP-Complete problem through DNA Computing Algorithm

Mr. Naveen Hemrajani; Mr. Shalini Rajawat

:Analyzing Complexity for NP-Complete problem through DNA Computing Algorithm

Mr. Naveen Hemrajani * §

Contact

Mr. Shalini Rajawat

Contact

Dr. Ekta Menghani

Contact

Suresh Gyan Vihar University, Jaipur, INDIA

:Analyzing Complexity for NP-Complete problem through DNA Computing Algorithm

Article Fingerprint

ReserarchID

CST6UOZO

:Analyzing Complexity for NP-Complete problem through DNA Computing Algorithm Banner

Key Research Insights

Synthesized scholarly intelligence & interactive research assistant

Abstract

Adleman and Lipton adopted a brute-force search strategy to solve NP-complete problems by DNA computing i.e., a DNA data pool containing the full solution space must first be constructed in the initial test tube (t0), and then correct answers are extracted and/or false ones are eliminated from the data pool step by step. Thus, the number of distinct DNA strands contained in the initial test tube (t0) grows exponentially with the size of the problem. The number of DNA strands required for large problems eventually swamps the DNA data storage, which makes molecular computation impractical from the outset. Lipton’s brute-force search DNA algorithm is limited to about 60 to 70 variables and thus it is believed that DNA computers that use a brute-force search algorithm can not exceed the performance of electronic computers. Since then, studies on DNA computing have focused on reducing the size of the data pool. A few new algorithms, such as the breadth-first search algorithm , Genetic algorithm , random walking algorithm , have been proposed and tested. With the breadth-first search algorithm, the capacity of a DNA computer can be theoretically increased to about 120 variables, but even so, DNA computers are still not capable of competing with electronic computers. Previously, we solved the SAT problem using a DNA computing algorithm based on ligase chain reaction. In the present study, we solve the SAT problem with the same DNA computing strategy using alternative biotechnical operations. Here we report some new results on the universality and space complexity of this DNA computing algorithm.

References

8 Cites in Article

Reference Format

B Selman,D Mitchell,H Levesque (1996). Generating hard satisfiability problem.
Xiaolong Wang,Zhenmin Bao,Jingjie Hu,Shi Wang,Aibin Zhan (2008). Solving the SAT problem using a DNA computing algorithm based on ligase chain reaction.
Qi Ouyang,Peter Kaplan,Shumao Liu,Albert Libchaber (1997). DNA Solution of the Maximal Clique Problem.
Leonard Adleman (1994). Molecular Computation of Solutions to Combinatorial Problems.
R Lipton (1995). Using DNA to solve NP-complete problems.
H Yoshida,A Suyama (2000). DIMACS: Series in Discrete Mathematics and Theoretical Computer Science. Solution to 3-SAT by Breadth-First Search.
Y Li,C Fang,Q Ouyang (2004). Genetic algorithm in DNA computing: A solution to the maximal clique problem.
Wenbin Liu,Lin Gao,Qiang Zhang,Guandong Xu,Xiangou Zhu,Xiangrong Liu,Jin Xu (2005). A Random Walk DNA Algorithm for the 3-SAT Problem.

Download References

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

Mr. Naveen Hemrajani, Mr. Shalini Rajawat, Dr. Ekta Menghani. 1970. ":Analyzing Complexity for NP-Complete problem through DNA Computing Algorithm". Global Journal of Computer Science and Technology GJCST Volume 10 (GJCST Volume 10 Issue 13).

More Citation Formats

Select Citation Style:

Download Citation

GJCST Volume 10 Issue 13

Explore Journals Explore Volume Read This Issue

Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords

Not Found

Submission ReceivedFebruary 12, 2010
Peer Review Double Blind
Handling Editor
Accepted March 3, 2010
Published March 15, 2010

Version of record

v1.2

Issue date

October 12, 2010

Language

English

Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

View in VR

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

View in 3D

Article Matrices

Total Score: 149

Country: India

Subject: Global Journal of Computer Science and Technology

Authors: Mr. Shalini Rajawat, Dr Vijay Singh Rathore, Mr. Naveen Hemrajani, Dr. Ekta Menghani (PhD/Dr. count: 1)

View Count (all-time): 187

Total Views (Real + Logic): 7772

Total Downloads (simulated): 516

Publish Date: 2010 03, Mon

Monthly Totals (Real + Logic):

Month 1: 44 views
Month 2: 30 views
Month 3: 37 views
Month 4: 52 views
Month 5: 62 views
Month 6: 50 views
Month 7: 38 views
Month 8: 34 views
Month 9: 20 views
Month 10: 40 views
Month 11: 22 views
Month 12: 31 views
Month 13: 34 views
Month 14: 31 views
Month 15: 36 views
Month 16: 14 views
Month 17: 42 views
Month 18: 24 views
Month 19: 39 views
Month 20: 29 views
Month 21: 13 views
Month 22: 33 views
Month 23: 23 views
Month 24: 38 views
Month 25: 29 views
Month 26: 25 views
Month 27: 34 views
Month 28: 30 views
Month 29: 37 views
Month 30: 44 views
Month 31: 41 views
Month 32: 33 views
Month 33: 30 views
Month 34: 26 views
Month 35: 26 views
Month 36: 22 views
Month 37: 29 views
Month 38: 36 views
Month 39: 26 views
Month 40: 18 views
Month 41: 39 views
Month 42: 14 views
Month 43: 34 views
Month 44: 29 views
Month 45: 27 views
Month 46: 16 views
Month 47: 45 views
Month 48: 14 views
Month 49: 31 views
Month 50: 31 views
Month 51: 29 views
Month 52: 22 views
Month 53: 27 views
Month 54: 39 views
Month 55: 28 views
Month 56: 20 views
Month 57: 14 views
Month 58: 20 views
Month 59: 13 views
Month 60: 28 views
Month 61: 30 views
Month 62: 25 views
Month 63: 14 views
Month 64: 24 views
Month 65: 21 views
Month 66: 34 views
Month 67: 21 views
Month 68: 33 views
Month 69: 33 views
Month 70: 11 views
Month 71: 43 views
Month 72: 11 views
Month 73: 27 views
Month 74: 19 views
Month 75: 24 views
Month 76: 44 views
Month 77: 25 views
Month 78: 50 views
Month 79: 14 views
Month 80: 47 views
Month 81: 23 views
Month 82: 15 views
Month 83: 17 views
Month 84: 19 views
Month 85: 28 views
Month 86: 23 views
Month 87: 26 views
Month 88: 10 views
Month 89: 41 views
Month 90: 25 views
Month 91: 38 views
Month 92: 21 views
Month 93: 17 views
Month 94: 34 views
Month 95: 18 views
Month 96: 39 views
Month 97: 39 views
Month 98: 23 views
Month 99: 17 views
Month 100: 30 views
Month 101: 37 views
Month 102: 32 views
Month 103: 27 views
Month 104: 15 views
Month 105: 19 views
Month 106: 19 views
Month 107: 33 views
Month 108: 44 views
Month 109: 31 views
Month 110: 29 views
Month 111: 32 views
Month 112: 24 views
Month 113: 32 views
Month 114: 44 views
Month 115: 27 views
Month 116: 17 views
Month 117: 31 views
Month 118: 40 views
Month 119: 48 views
Month 120: 39 views
Month 121: 46 views
Month 122: 35 views
Month 123: 25 views
Month 124: 34 views
Month 125: 17 views
Month 126: 45 views
Month 127: 46 views
Month 128: 37 views
Month 129: 31 views
Month 130: 36 views
Month 131: 36 views
Month 132: 23 views
Month 133: 35 views
Month 134: 27 views
Month 135: 30 views
Month 136: 16 views
Month 137: 36 views
Month 138: 34 views
Month 139: 29 views
Month 140: 38 views
Month 141: 29 views
Month 142: 26 views
Month 143: 22 views
Month 144: 16 views
Month 145: 16 views
Month 146: 26 views
Month 147: 36 views
Month 148: 17 views
Month 149: 22 views
Month 150: 29 views
Month 151: 29 views
Month 152: 42 views
Month 153: 36 views
Month 154: 35 views
Month 155: 21 views
Month 156: 14 views
Month 157: 32 views
Month 158: 19 views
Month 159: 38 views
Month 160: 36 views
Month 161: 20 views
Month 162: 39 views
Month 163: 36 views
Month 164: 37 views
Month 165: 36 views
Month 166: 30 views
Month 167: 43 views
Month 168: 32 views
Month 169: 37 views
Month 170: 43 views
Month 171: 32 views
Month 172: 22 views
Month 173: 44 views
Month 174: 24 views
Month 175: 31 views
Month 176: 36 views
Month 177: 27 views
Month 178: 17 views
Month 179: 23 views
Month 180: 22 views
Month 181: 24 views
Month 182: 25 views
Month 183: 24 views
Month 184: 24 views
Month 185: 24 views
Month 186: 34 views
Month 187: 23 views
Month 188: 34 views
Month 189: 34 views
Month 190: 44 views
Month 191: 27 views
Month 192: 12 views
Month 193: 38 views
Month 194: 24 views
Month 195: 27 views
Month 196: 33 views
Month 197: 52 views
Month 198: 47 views
Month 199: 45 views

Total Views: 7.8K

Total Downloads: 516

All Trends