Loading...
Please wait, while we are loading the content...
Solving Minimum Vertex Cover Problem Using DNA Computing
| Content Provider | Scilit |
|---|---|
| Author | Rudiman Hasudungan, Rofilde Pangestuty, Dwi M. Latifah, Asslia J. |
| Copyright Year | 2019 |
| Description | Journal: Journal of Physics: Conference Series Minimum vertex cover problem is one of classical problem not only in mathematic but also in computer science. However, this problem considered as complex problem since is classify as NP-Hard. This paper proposed new technique based on DNA computing that has good capability to tacked parallel computation. This paper provide new DNA encoding and a set Bio-operation procedure to solve this problem. The result of this technique yield the correct optimum solution with better time complexity (O(1)) compared the previous algorithms. |
| Related Links | https://iopscience.iop.org/article/10.1088/1742-6596/1361/1/012038/pdf |
| ISSN | 17426588 |
| e-ISSN | 17426596 |
| DOI | 10.1088/1742-6596/1361/1/012038 |
| Journal | Journal of Physics: Conference Series |
| Issue Number | 1 |
| Volume Number | 1361 |
| Language | English |
| Publisher | IOP Publishing |
| Publisher Date | 2019-11-01 |
| Access Restriction | Open |
| Subject Keyword | Journal: Journal of Physics: Conference Series Hardware and Architecture Dna Computing Minimum Vertex Cover Problem Vertex Cover Classical Problem |
| Content Type | Text |
| Resource Type | Article |
| Subject | Physics and Astronomy |