BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

125 related articles for article (PubMed ID: 32212630)

  • 1. In Vitro Identification of the Hamiltonian Cycle Using a Circular Structure Assisted DNA Computer.
    Sharma D; Ramteke M
    ACS Comb Sci; 2020 May; 22(5):225-231. PubMed ID: 32212630
    [TBL] [Abstract][Full Text] [Related]  

  • 2. DNA computing the Hamiltonian path problem.
    Lee CM; Kim SW; Kim SM; Sohn U
    Mol Cells; 1999 Oct; 9(5):464-9. PubMed ID: 10597033
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Solving the Family Traveling Salesperson Problem in the Adleman-Lipton Model Based on DNA Computing.
    Wu X; Wang Z; Wu T; Bao X
    IEEE Trans Nanobioscience; 2022 Jan; 21(1):75-85. PubMed ID: 34460379
    [TBL] [Abstract][Full Text] [Related]  

  • 4. [DNA computing].
    Błasiak J; Krasiński T; Popławski T; Sakowski S
    Postepy Biochem; 2011; 57(1):13-23. PubMed ID: 21735816
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Demonstration of a universal surface DNA computer.
    Su X; Smith LM
    Nucleic Acids Res; 2004; 32(10):3115-23. PubMed ID: 15181177
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Molecular Sticker Model Stimulation on Silicon for a Maximum Clique Problem.
    Ning J; Li Y; Yu W
    Int J Mol Sci; 2015 Jun; 16(6):13474-89. PubMed ID: 26075867
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Solving the set cover problem and the problem of exact cover by 3-sets in the Adleman-Lipton model.
    Chang WL; Guo M
    Biosystems; 2003 Dec; 72(3):263-75. PubMed ID: 14643494
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Exploring the Potential of DNA Computing for Complex Big Data Problems: A Case Study on the Traveling Car Renter Problem.
    Wang ZC; Wu X; Liang K; Wu TH
    IEEE Trans Nanobioscience; 2024 Jul; 23(3):391-402. PubMed ID: 38709614
    [TBL] [Abstract][Full Text] [Related]  

  • 9. A novel bio-heuristic computing algorithm to solve the capacitated vehicle routing problem based on Adleman-Lipton model.
    Wang Z; Ren X; Ji Z; Huang W; Wu T
    Biosystems; 2019 Oct; 184():103997. PubMed ID: 31369836
    [TBL] [Abstract][Full Text] [Related]  

  • 10. A general resolution of intractable problems in polynomial time through DNA Computing.
    Sanches CA; Soma NY
    Biosystems; 2016 Dec; 150():119-131. PubMed ID: 27693626
    [TBL] [Abstract][Full Text] [Related]  

  • 11. A Parallel DNA Algorithm for Solving the Quota Traveling Salesman Problem Based on Biocomputing Model.
    Wang Z; Wu X; Wu T
    Comput Intell Neurosci; 2022; 2022():1450756. PubMed ID: 36093485
    [TBL] [Abstract][Full Text] [Related]  

  • 12. A new parallel DNA algorithm to solve the task scheduling problem based on inspired computational model.
    Wang Z; Ji Z; Wang X; Wu T; Huang W
    Biosystems; 2017 Dec; 162():59-65. PubMed ID: 28890344
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Towards a Bioelectronic Computer: A Theoretical Study of a Multi-Layer Biomolecular Computing System That Can Process Electronic Inputs.
    Dunn KE; Trefzer MA; Johnson S; Tyrrell AM
    Int J Mol Sci; 2018 Sep; 19(9):. PubMed ID: 30181468
    [TBL] [Abstract][Full Text] [Related]  

  • 14. A DNA algorithm for the job shop scheduling problem based on the Adleman-Lipton model.
    Tian X; Liu X; Zhang H; Sun M; Zhao Y
    PLoS One; 2020; 15(12):e0242083. PubMed ID: 33264317
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Scalability of the surface-based DNA algorithm for 3-SAT.
    Li D; Li X; Huang H; Li X
    Biosystems; 2006 Aug; 85(2):95-8. PubMed ID: 16423447
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Solving satisfiability problems using a novel microarray-based DNA computer.
    Lin CH; Cheng HP; Yang CB; Yang CN
    Biosystems; 2007; 90(1):242-52. PubMed ID: 17029765
    [TBL] [Abstract][Full Text] [Related]  

  • 17. An unenumerative DNA computing model for vertex coloring problem.
    Xu J; Qiang X; Yang Y; Wang B; Yang D; Luo L; Pan L; Wang S
    IEEE Trans Nanobioscience; 2011 Jun; 10(2):94-8. PubMed ID: 21742570
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Molecular solutions to the binary integer programming problem based on DNA computation.
    Yeh CW; Chu CP; Wu KR
    Biosystems; 2006 Jan; 83(1):56-66. PubMed ID: 16229936
    [TBL] [Abstract][Full Text] [Related]  

  • 19. A CLIQUE algorithm using DNA computing techniques based on closed-circle DNA sequences.
    Zhang H; Liu X
    Biosystems; 2011 Jul; 105(1):73-82. PubMed ID: 21511001
    [TBL] [Abstract][Full Text] [Related]  

  • 20. DNA computing on surfaces.
    Liu Q; Wang L; Frutos AG; Condon AE; Corn RM; Smith LM
    Nature; 2000 Jan; 403(6766):175-9. PubMed ID: 10646598
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.