A DNA-based solution to the graph isomorphism problem using Adleman–Lipton model with stickers
Since the experimental demonstration of its feasibility, DNA-based computing has been applied to a number of decision or combinatorial optimization problems. The graph isomorphism problem belongs to the class of NP problems, and has been conjectured intractable, although probably not NP-complete. In...
Saved in:
| Published in | Applied mathematics and computation Vol. 197; no. 2; pp. 672 - 686 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
New York, NY
Elsevier Inc
01.04.2008
Elsevier |
| Subjects | |
| Online Access | Get full text |
| ISSN | 0096-3003 1873-5649 |
| DOI | 10.1016/j.amc.2007.08.005 |
Cover
| Abstract | Since the experimental demonstration of its feasibility, DNA-based computing has been applied to a number of decision or combinatorial optimization problems. The graph isomorphism problem belongs to the class of NP problems, and has been conjectured intractable, although probably not NP-complete. In this paper, we demonstrate the power of DNA-based computing by showing the graph isomorphism problem can be efficiently solved under this computation model. By generating the solution space using stickers, we present DNA-based algorithms to solve the problem using polynomial number of basic biological operations. |
|---|---|
| AbstractList | Since the experimental demonstration of its feasibility, DNA-based computing has been applied to a number of decision or combinatorial optimization problems. The graph isomorphism problem belongs to the class of NP problems, and has been conjectured intractable, although probably not NP-complete. In this paper, we demonstrate the power of DNA-based computing by showing the graph isomorphism problem can be efficiently solved under this computation model. By generating the solution space using stickers, we present DNA-based algorithms to solve the problem using polynomial number of basic biological operations. |
| Author | Hsieh, Sun-Yuan Chen, Ming-Yu |
| Author_xml | – sequence: 1 givenname: Sun-Yuan surname: Hsieh fullname: Hsieh, Sun-Yuan email: hsiehsy@mail.ncku.edu.tw – sequence: 2 givenname: Ming-Yu surname: Chen fullname: Chen, Ming-Yu email: chenmy@iis.sinica.edu.tw |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=20162151$$DView record in Pascal Francis |
| BookMark | eNp9kL1OHDEQgK0IpByXPEA6N5S7Ga9vf05UJwIJ0ok09GbWHnO-7K5Xtgmi4x3yhjxJfLqIIgXVTPF9I813xk4mPxFjXwSUAkTzdV_iqMsKoC2hKwHqD2whulYWdbNan7AFwLopJID8yM5i3EMGG7FasPsN_3a7KXqMZHj0w2NyfuLJ87Qj_hBw3nEX_ejDvHNx5HPw_UAjf4xueuAbk3ecXl_-bN2csjd6QwN_cmnHY3L6F4X4iZ1aHCJ9_jeX7O766u7yR7H9-f3mcrMttKzaVJiGaoNWVoIqY6EFWElNrawBbSP6fm1kL9aikbiyfWMNtqZrbYWdBN0TyiU7P56dMWocbMBJu6jm4EYMz6rKjSpRi8yJI6eDjzGQfUMEqENJtVe5pDqUVNCpXDI77X-OdgkPoVJAN7xrXhxNyp__dhRU1I4mTcYF0kkZ796x_wLHqJIo |
| CODEN | AMHCBQ |
| CitedBy_id | crossref_primary_10_1016_j_amc_2009_07_051 crossref_primary_10_1016_j_ijleo_2015_11_068 crossref_primary_10_1016_j_jpdc_2008_06_002 crossref_primary_10_1371_journal_pone_0242083 crossref_primary_10_1016_j_amc_2014_04_022 crossref_primary_10_1016_j_biosystems_2016_09_008 crossref_primary_10_1016_j_amc_2009_02_011 crossref_primary_10_1088_1402_4896_ac65bf crossref_primary_10_1016_j_amc_2010_11_019 |
| Cites_doi | 10.1126/science.7973651 10.1126/science.7725098 10.1016/S0303-2647(03)00149-7 10.1016/j.future.2003.10.010 10.1016/S0039-6028(01)01524-2 10.1126/science.273.5272.220 10.1016/j.biosystems.2003.11.001 10.1073/pnas.97.4.1385 10.1126/science.278.5337.446 10.1109/TNB.2005.850474 10.1016/j.parco.2004.07.014 10.1038/35003155 10.1126/science.288.5469.1223 10.1016/j.biosystems.2004.10.003 |
| ContentType | Journal Article |
| Copyright | 2007 Elsevier Inc. 2008 INIST-CNRS |
| Copyright_xml | – notice: 2007 Elsevier Inc. – notice: 2008 INIST-CNRS |
| DBID | AAYXX CITATION IQODW |
| DOI | 10.1016/j.amc.2007.08.005 |
| DatabaseName | CrossRef Pascal-Francis |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics |
| EISSN | 1873-5649 |
| EndPage | 686 |
| ExternalDocumentID | 20162151 10_1016_j_amc_2007_08_005 S0096300307008247 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 23M 4.4 457 4G. 5GY 5VS 6J9 7-5 71M 8P~ 9JN AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO ABAOU ABEFU ABFNM ABFRF ABJNI ABMAC ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACRLP ADBBV ADEZE ADGUI ADIYS ADMUD AEBSH AEFWE AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AI. AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CS3 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q GBLVA HLZ HMJ HVGLF HZ~ IHE J1W KOM LG9 M26 M41 MHUIS MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG RNS ROL RPZ RXW SBC SDF SDG SES SEW SME SPC SPCBC SSW SSZ T5K TAE TN5 VH1 VOH WH7 WUQ X6Y XPP ZMT ~02 ~G- AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD AFXIZ AGCQF AGRNS BNPGV IQODW SSH |
| ID | FETCH-LOGICAL-c327t-d6e5daf321e2df070043ce7350af61bb9d3b19163a4fb6fda7d87f2a830cbea3 |
| IEDL.DBID | AIKHN |
| ISSN | 0096-3003 |
| IngestDate | Mon Jul 21 09:15:11 EDT 2025 Wed Oct 01 04:43:11 EDT 2025 Thu Apr 24 23:11:29 EDT 2025 Fri Feb 23 02:18:48 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | Data engineering applications on bioinformatics Molecular computing The graph isomorphism problem NP-complete DNA-based algorithms DNA-based computing Biological operations Polynomial Combinatorial problem Optimization method Combinatorial optimization Algorithm Numerical analysis Applied mathematics DNA Isomorphism |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c327t-d6e5daf321e2df070043ce7350af61bb9d3b19163a4fb6fda7d87f2a830cbea3 |
| PageCount | 15 |
| ParticipantIDs | pascalfrancis_primary_20162151 crossref_primary_10_1016_j_amc_2007_08_005 crossref_citationtrail_10_1016_j_amc_2007_08_005 elsevier_sciencedirect_doi_10_1016_j_amc_2007_08_005 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2008-04-01 |
| PublicationDateYYYYMMDD | 2008-04-01 |
| PublicationDate_xml | – month: 04 year: 2008 text: 2008-04-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationPlace | New York, NY |
| PublicationPlace_xml | – name: New York, NY |
| PublicationTitle | Applied mathematics and computation |
| PublicationYear | 2008 |
| Publisher | Elsevier Inc Elsevier |
| Publisher_xml | – name: Elsevier Inc – name: Elsevier |
| References | Weng-Long Chang, Minyi Guo, Solving NP-complete problem in the Adleman–Lipton model, in: Proceedings of 2002 International Conference on Computer and Information Technology, 2002, pp. 157–162. Sinden (bib25) 1994 Weng-Long Chang, Minyi Guo, Resolving the 3-dimensional matching problem and the set-packing problem in Adleman-Liptons model, in: Proceedings of IASTED International Conference, Networks, Parallel and Distributed Processing, and Applications, 2002, pp. 455–460. Sakamoto, Gouzu, Komiya, Kiga, Yokoyama, Yokomori, Hagiya (bib24) 2000; 288 Chang, Guo (bib7) 2003; 72 Chang, Guo, Ho (bib8) 2004; 20 Weng-Long Chang, Minyi Guo, Solving the dominating-set problem in Adleman-Lipton’s model, in: Proceedings of the Third International Conference on Parallel and Distributed Computing, Applications and Technologies, 2002, pp. 167–172. Feynman (bib13) 1961 Gillmor, Rugheimer, Lagally (bib14) 2002; 500 Ouyang, Kaplan, Liu, Libchaber (bib20) 1997; 278 S. Roweis, E. Winfree, R. Burgoyne, N.V. Chelyapov, M.F. Goodman, P.W.K. Rothemund, L.M. Adleman, A sticker based model for DNA computation, in: Proceedings of the Second Annual Worksop on DNA Computing, DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, pp. 1–29. Adleman (bib1) 1994; 266 Chang, Guo, Ho (bib9) 2004; 73 Paˇun, Rozenberg, Salomaa (bib21) 1998 Chang, Guo, Ho (bib10) 2005; 4 R.S. Braich, C. Johnson, P.W.K. Rothemund, D. Hwang, N. Chelyapov, M. Leonard, L.M. Adleman, Solution of a satisfiability problem on a gel-based DNA computer, in: Proceedings of the Sixth International Conference on DNA Computation (DNA 2000), Lecture Notes in Computer Science, vol. 2054, 2001, pp. 27–42. Guo, Ho, Chang (bib16) 2004; 30 Weng-Long Chang, Minyi Guo, Solving the clique problem and the vertex cover problem in Adleman-Lipton’s model, in: Proceedings of IASTED International Conference, Networks, Parallel and Distributed Processing, and Applications, 2002, pp. 431–436. Cormen, Leiserson, Rivest, Stein (bib11) 2001 Liu, Wang, Frutos, Condon, Corn, Smith (bib19) 1995; 403 Guo, Chang, Ho, Lu, Cao (bib17) 2005; 80 Papadimitrious (bib22) 1994 Guarnieri, Fliss, Bancroft (bib15) 1996; 273 Faullhammer, Cukras, Lipton, Landweber (bib12) 2000; 97 Lipton (bib18) 1995; 268 Papadimitrious (10.1016/j.amc.2007.08.005_bib22) 1994 Paˇun (10.1016/j.amc.2007.08.005_bib21) 1998 Chang (10.1016/j.amc.2007.08.005_bib7) 2003; 72 Ouyang (10.1016/j.amc.2007.08.005_bib20) 1997; 278 Chang (10.1016/j.amc.2007.08.005_bib8) 2004; 20 Liu (10.1016/j.amc.2007.08.005_bib19) 1995; 403 Sinden (10.1016/j.amc.2007.08.005_bib25) 1994 Cormen (10.1016/j.amc.2007.08.005_bib11) 2001 Faullhammer (10.1016/j.amc.2007.08.005_bib12) 2000; 97 10.1016/j.amc.2007.08.005_bib23 Lipton (10.1016/j.amc.2007.08.005_bib18) 1995; 268 Sakamoto (10.1016/j.amc.2007.08.005_bib24) 2000; 288 Feynman (10.1016/j.amc.2007.08.005_bib13) 1961 Guarnieri (10.1016/j.amc.2007.08.005_bib15) 1996; 273 Guo (10.1016/j.amc.2007.08.005_bib17) 2005; 80 10.1016/j.amc.2007.08.005_bib4 10.1016/j.amc.2007.08.005_bib3 10.1016/j.amc.2007.08.005_bib2 Gillmor (10.1016/j.amc.2007.08.005_bib14) 2002; 500 Guo (10.1016/j.amc.2007.08.005_bib16) 2004; 30 10.1016/j.amc.2007.08.005_bib6 10.1016/j.amc.2007.08.005_bib5 Chang (10.1016/j.amc.2007.08.005_bib9) 2004; 73 Chang (10.1016/j.amc.2007.08.005_bib10) 2005; 4 Adleman (10.1016/j.amc.2007.08.005_bib1) 1994; 266 |
| References_xml | – volume: 72 start-page: 263 year: 2003 end-page: 275 ident: bib7 article-title: Solving the set cover problem and the problem of exact 3 cover by 3-sets in the Adleman–Lipton model publication-title: Biosystems – year: 2001 ident: bib11 article-title: Introduction to Algorithms – volume: 97 start-page: 1385 year: 2000 end-page: 1389 ident: bib12 article-title: Molecular computation: RNA solutions to chess problems publication-title: Proceedings of National Academica Science USA – volume: 500 start-page: 699 year: 2002 end-page: 721 ident: bib14 article-title: Computing with DNA on surfaces publication-title: Surface Science – reference: R.S. Braich, C. Johnson, P.W.K. Rothemund, D. Hwang, N. Chelyapov, M. Leonard, L.M. Adleman, Solution of a satisfiability problem on a gel-based DNA computer, in: Proceedings of the Sixth International Conference on DNA Computation (DNA 2000), Lecture Notes in Computer Science, vol. 2054, 2001, pp. 27–42. – reference: S. Roweis, E. Winfree, R. Burgoyne, N.V. Chelyapov, M.F. Goodman, P.W.K. Rothemund, L.M. Adleman, A sticker based model for DNA computation, in: Proceedings of the Second Annual Worksop on DNA Computing, DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, pp. 1–29. – reference: Weng-Long Chang, Minyi Guo, Solving the dominating-set problem in Adleman-Lipton’s model, in: Proceedings of the Third International Conference on Parallel and Distributed Computing, Applications and Technologies, 2002, pp. 167–172. – year: 1998 ident: bib21 article-title: DNA Computing: New Computing Paradigms – start-page: 282 year: 1961 end-page: 296 ident: bib13 publication-title: Minaturization – volume: 20 start-page: 875 year: 2004 end-page: 885 ident: bib8 article-title: Solving the set-splitting problem in sticker-based model and the Adleman-VLipton model publication-title: Future Generation Computer Systems – volume: 80 start-page: 71 year: 2005 end-page: 82 ident: bib17 article-title: Is optimal solution of every NP-complete or NP-hard problem determined from its characteristic for DNA-based computing publication-title: Biosystems – year: 1994 ident: bib22 article-title: Computational Complexity – volume: 278 start-page: 446 year: 1997 end-page: 449 ident: bib20 article-title: DNA solution of the maximal clique problem publication-title: Science – volume: 4 start-page: 149 year: 2005 end-page: 163 ident: bib10 article-title: Fast parallel molecular algorithms for DNA-based computation: factoring integers publication-title: IEEE Transactions on Nanobioscience – volume: 73 start-page: 117 year: 2004 end-page: 130 ident: bib9 article-title: Molecular solutions for the subset-sum problem on DNA-based supercomputing publication-title: Biosystems – year: 1994 ident: bib25 article-title: DNA Structure and Function – volume: 268 start-page: 542 year: 1995 end-page: 545 ident: bib18 article-title: DNA solution of hard computational problems publication-title: Science – volume: 403 start-page: 175 year: 1995 end-page: 179 ident: bib19 article-title: DNA computing on surfaces publication-title: Nature – reference: Weng-Long Chang, Minyi Guo, Solving the clique problem and the vertex cover problem in Adleman-Lipton’s model, in: Proceedings of IASTED International Conference, Networks, Parallel and Distributed Processing, and Applications, 2002, pp. 431–436. – reference: Weng-Long Chang, Minyi Guo, Resolving the 3-dimensional matching problem and the set-packing problem in Adleman-Liptons model, in: Proceedings of IASTED International Conference, Networks, Parallel and Distributed Processing, and Applications, 2002, pp. 455–460. – volume: 288 start-page: 1223 year: 2000 end-page: 1226 ident: bib24 article-title: Molecular computation by DNA hairpin formation publication-title: Science – volume: 266 start-page: 1021 year: 1994 end-page: 1024 ident: bib1 article-title: Molecular computation of solutions to combinatorial problems publication-title: Science – reference: Weng-Long Chang, Minyi Guo, Solving NP-complete problem in the Adleman–Lipton model, in: Proceedings of 2002 International Conference on Computer and Information Technology, 2002, pp. 157–162. – volume: 273 start-page: 220 year: 1996 end-page: 223 ident: bib15 article-title: Making DNA add publication-title: Science – volume: 30 start-page: 1109 year: 2004 end-page: 1125 ident: bib16 article-title: Fast parallel molecular solution to the dominating-set problem on massively parallel bio-computing publication-title: Parallel Computing – volume: 266 start-page: 1021 year: 1994 ident: 10.1016/j.amc.2007.08.005_bib1 article-title: Molecular computation of solutions to combinatorial problems publication-title: Science doi: 10.1126/science.7973651 – volume: 268 start-page: 542 year: 1995 ident: 10.1016/j.amc.2007.08.005_bib18 article-title: DNA solution of hard computational problems publication-title: Science doi: 10.1126/science.7725098 – volume: 72 start-page: 263 issue: 3 year: 2003 ident: 10.1016/j.amc.2007.08.005_bib7 article-title: Solving the set cover problem and the problem of exact 3 cover by 3-sets in the Adleman–Lipton model publication-title: Biosystems doi: 10.1016/S0303-2647(03)00149-7 – volume: 20 start-page: 875 issue: 5 year: 2004 ident: 10.1016/j.amc.2007.08.005_bib8 article-title: Solving the set-splitting problem in sticker-based model and the Adleman-VLipton model publication-title: Future Generation Computer Systems doi: 10.1016/j.future.2003.10.010 – volume: 500 start-page: 699 year: 2002 ident: 10.1016/j.amc.2007.08.005_bib14 article-title: Computing with DNA on surfaces publication-title: Surface Science doi: 10.1016/S0039-6028(01)01524-2 – ident: 10.1016/j.amc.2007.08.005_bib23 – volume: 273 start-page: 220 year: 1996 ident: 10.1016/j.amc.2007.08.005_bib15 article-title: Making DNA add publication-title: Science doi: 10.1126/science.273.5272.220 – year: 1994 ident: 10.1016/j.amc.2007.08.005_bib25 – volume: 73 start-page: 117 issue: 2 year: 2004 ident: 10.1016/j.amc.2007.08.005_bib9 article-title: Molecular solutions for the subset-sum problem on DNA-based supercomputing publication-title: Biosystems doi: 10.1016/j.biosystems.2003.11.001 – volume: 97 start-page: 1385 year: 2000 ident: 10.1016/j.amc.2007.08.005_bib12 article-title: Molecular computation: RNA solutions to chess problems publication-title: Proceedings of National Academica Science USA doi: 10.1073/pnas.97.4.1385 – year: 1994 ident: 10.1016/j.amc.2007.08.005_bib22 – ident: 10.1016/j.amc.2007.08.005_bib3 – ident: 10.1016/j.amc.2007.08.005_bib5 – volume: 278 start-page: 446 year: 1997 ident: 10.1016/j.amc.2007.08.005_bib20 article-title: DNA solution of the maximal clique problem publication-title: Science doi: 10.1126/science.278.5337.446 – year: 1998 ident: 10.1016/j.amc.2007.08.005_bib21 – volume: 4 start-page: 149 issue: 2 year: 2005 ident: 10.1016/j.amc.2007.08.005_bib10 article-title: Fast parallel molecular algorithms for DNA-based computation: factoring integers publication-title: IEEE Transactions on Nanobioscience doi: 10.1109/TNB.2005.850474 – volume: 30 start-page: 1109 year: 2004 ident: 10.1016/j.amc.2007.08.005_bib16 article-title: Fast parallel molecular solution to the dominating-set problem on massively parallel bio-computing publication-title: Parallel Computing doi: 10.1016/j.parco.2004.07.014 – year: 2001 ident: 10.1016/j.amc.2007.08.005_bib11 – ident: 10.1016/j.amc.2007.08.005_bib2 – volume: 403 start-page: 175 year: 1995 ident: 10.1016/j.amc.2007.08.005_bib19 article-title: DNA computing on surfaces publication-title: Nature doi: 10.1038/35003155 – volume: 288 start-page: 1223 year: 2000 ident: 10.1016/j.amc.2007.08.005_bib24 article-title: Molecular computation by DNA hairpin formation publication-title: Science doi: 10.1126/science.288.5469.1223 – ident: 10.1016/j.amc.2007.08.005_bib4 – ident: 10.1016/j.amc.2007.08.005_bib6 – start-page: 282 year: 1961 ident: 10.1016/j.amc.2007.08.005_bib13 – volume: 80 start-page: 71 issue: 1 year: 2005 ident: 10.1016/j.amc.2007.08.005_bib17 article-title: Is optimal solution of every NP-complete or NP-hard problem determined from its characteristic for DNA-based computing publication-title: Biosystems doi: 10.1016/j.biosystems.2004.10.003 |
| SSID | ssj0007614 |
| Score | 1.9788208 |
| Snippet | Since the experimental demonstration of its feasibility, DNA-based computing has been applied to a number of decision or combinatorial optimization problems.... |
| SourceID | pascalfrancis crossref elsevier |
| SourceType | Index Database Enrichment Source Publisher |
| StartPage | 672 |
| SubjectTerms | Biological operations Data engineering applications on bioinformatics DNA-based algorithms DNA-based computing Exact sciences and technology Mathematical analysis Mathematics Molecular computing NP-complete Numerical analysis Numerical analysis. Scientific computation Sciences and techniques of general use The graph isomorphism problem |
| Title | A DNA-based solution to the graph isomorphism problem using Adleman–Lipton model with stickers |
| URI | https://dx.doi.org/10.1016/j.amc.2007.08.005 |
| Volume | 197 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier ScienceDirect customDbUrl: eissn: 1873-5649 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0007614 issn: 0096-3003 databaseCode: .~1 dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier ScienceDirect customDbUrl: eissn: 1873-5649 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0007614 issn: 0096-3003 databaseCode: AIKHN dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier ScienceDirect customDbUrl: eissn: 1873-5649 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0007614 issn: 0096-3003 databaseCode: ACRLP dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVLSH databaseName: Elsevier Journals customDbUrl: mediaType: online eissn: 1873-5649 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0007614 issn: 0096-3003 databaseCode: AKRWK dateStart: 19930101 isFulltext: true providerName: Library Specific Holdings |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3JTsMwEB11uYAQYhVlqXzghBSaxImdHKtCVZb2VKTegh3bqEAX0XJF_AN_yJfgaZKKHuiBa2Qn0Xg0bxI_vwdwbjFcqTT1HOFq5gRS4Sahzx1h0dZLfWT_4UHhbo91HoLbQTgoQas4C4O0yrz2ZzV9Ua3zK408mo3pcIhnfGPUi8KktTgW8DJULf5EUQWqzZu7Tm9ZkO2XeibGHCPNy6XF5uaC5iVGhZAhkirDv-BpaypmNmgmc7v4BUHtHdjOe0fSzF5vF0p6vAeb3aXw6mwfHpvkqtd0EJsUKdKKzCfEjiELcWoynE1GExvd4WxEcjsZguz3J4J79iMx_v78ureVxM5b2OQQ_FVLUM75xbaKB9BvX_dbHSc3UXBS6vO5o5gOlTDU97SvDMYqoKnmNHSFYZ6UsaLSfrMxKgIjmVGCq4gbX0TUTaUW9BAq48lYHwFhnhAeMyymWgRM8jj2Q8VZwEITKyajGrhF6JI0FxhHn4vXpGCSPSc22mh8yRP0vnTDGlwsp0wzdY11g4NiPZKVFEls9V83rb6ydssH2daHYcNz_L_7nsBGxh1BFs8pVOZv7_rMNihzWYfy5YdXz9PwB3r85ck |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3JTsMwELVKOQBCiFWUpfjACSk0iR27OVaFqkDbU5F6C3ZsowBdRMsV8Q_8IV-CJ0uhB3rgGtlxNB7NjOM37yF0bnO4UnHsOcLVzKFSwSWhzx1hs60X-4D-g0bhbo-17-ntIBiUULPohQFYZR77s5ieRuv8SS23Zm2SJNDjGwJfFDitzWOUr6BVapeBE9jl-w_Ow57TMyrmEEBeLimuNlOQlxgWNIYAqQz-Sk6bEzG1JjOZ1sWvBNTaRlt55Ygb2cftoJIe7aKN7px2dbqHHhr4qtdwIDMpXDgVno2xHYNTamqcTMfDsbVtMh3iXEwGA_b9EcON_VCMvj4-OzaO2HmpSA6GH7UYyJyfbaG4j_qt636z7eQSCk5MfD5zFNOBEob4nvaVAUtREmtOAlcY5kkZKiLtiY0RQY1kRgmu6tz4ok7cWGpBDlB5NB7pQ4SZJ4THDAuJFpRJHoZ-oDijLDChYrJeQW5huijO6cVB5eIlKnBkT5G1Nshe8giUL92ggi7mUyYZt8aywbTYj2jBQSIb-5dNqy7s3XwhW_gwKHeO_vfeM7TW7nc7Ueemd3eM1jMUCeB5TlB59vqmT22pMpPV1BW_AWTA5pE |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+DNA-based+solution+to+the+graph+isomorphism+problem+using+Adleman%E2%80%93Lipton+model+with+stickers&rft.jtitle=Applied+mathematics+and+computation&rft.au=Hsieh%2C+Sun-Yuan&rft.au=Chen%2C+Ming-Yu&rft.date=2008-04-01&rft.issn=0096-3003&rft.volume=197&rft.issue=2&rft.spage=672&rft.epage=686&rft_id=info:doi/10.1016%2Fj.amc.2007.08.005&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_amc_2007_08_005 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0096-3003&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0096-3003&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0096-3003&client=summon |