These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

153 related articles for article (PubMed ID: 15981311)

  • 1. Fast parallel molecular solutions for DNA-based supercomputing: the subset-product problem.
    Ho MS
    Biosystems; 2005 Jun; 80(3):233-50. PubMed ID: 15981311
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Molecular solutions for the subset-sum problem on DNA-based supercomputing.
    Chang WL; Ho MS; Guo M
    Biosystems; 2004 Feb; 73(2):117-30. PubMed ID: 15013224
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Fast parallel DNA-based algorithms for molecular computation: the set-partition problem.
    Chang WL
    IEEE Trans Nanobioscience; 2007 Dec; 6(4):346-53. PubMed ID: 18217628
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Fast parallel molecular algorithms for DNA-based computation: factoring integers.
    Chang WL; Guo M; Ho MS
    IEEE Trans Nanobioscience; 2005 Jun; 4(2):149-63. PubMed ID: 16117023
    [TBL] [Abstract][Full Text] [Related]  

  • 5. A novel generalized design methodology and realization of Boolean operations using DNA.
    Zoraida BS; Arock M; Ronald BS; Ponalagusamy R
    Biosystems; 2009 Sep; 97(3):146-53. PubMed ID: 19505531
    [TBL] [Abstract][Full Text] [Related]  

  • 6. 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]  

  • 7. Fast parallel molecular algorithms for DNA-based computation: solving the elliptic curve discrete logarithm problem over GF2.
    Li K; Zou S; Xv J
    J Biomed Biotechnol; 2008; 2008():518093. PubMed ID: 18431451
    [TBL] [Abstract][Full Text] [Related]  

  • 8. 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]  

  • 9. A DNA solution of SAT problem by a modified sticker model.
    Yang CN; Yang CB
    Biosystems; 2005 Jul; 81(1):1-9. PubMed ID: 15917122
    [TBL] [Abstract][Full Text] [Related]  

  • 10. A programming language for composable DNA circuits.
    Phillips A; Cardelli L
    J R Soc Interface; 2009 Aug; 6 Suppl 4(Suppl 4):S419-36. PubMed ID: 19535415
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Implementing digital computing with DNA-based switching circuits.
    Wang F; Lv H; Li Q; Li J; Zhang X; Shi J; Wang L; Fan C
    Nat Commun; 2020 Jan; 11(1):121. PubMed ID: 31913309
    [TBL] [Abstract][Full Text] [Related]  

  • 12. 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]  

  • 13. DNA computing using single-molecule hybridization detection.
    Schmidt KA; Henkel CV; Rozenberg G; Spaink HP
    Nucleic Acids Res; 2004; 32(17):4962-8. PubMed ID: 15388798
    [TBL] [Abstract][Full Text] [Related]  

  • 14. 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]  

  • 15. Quantum Speedup and Mathematical Solutions of Implementing Bio-Molecular Solutions for the Independent Set Problem on IBM Quantum Computers.
    Chang WL; Chen JC; Chung WY; Hsiao CY; Wong R; Vasilakos AV
    IEEE Trans Nanobioscience; 2021 Jul; 20(3):354-376. PubMed ID: 33900920
    [TBL] [Abstract][Full Text] [Related]  

  • 16. 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]  

  • 17. The emergence of complexity: lessons from DNA.
    Mao C
    PLoS Biol; 2004 Dec; 2(12):e431. PubMed ID: 15597116
    [TBL] [Abstract][Full Text] [Related]  

  • 18. 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]  

  • 19. Parallel algorithm research on several important open problems in bioinformatics.
    Niu BF; Lang XY; Lu ZH; Chi XB
    Interdiscip Sci; 2009 Sep; 1(3):187-95. PubMed ID: 20640837
    [TBL] [Abstract][Full Text] [Related]  

  • 20. A parallel algorithm for solving the n-queens problem based on inspired computational model.
    Wang Z; Huang D; Tan J; Liu T; Zhao K; Li L
    Biosystems; 2015 May; 131():22-9. PubMed ID: 25817410
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 8.