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 *

121 related articles for article (PubMed ID: 16805106)

  • 1. Hybridization-ligation versus parallel overlap assembly: an experimental comparison of initial pool generation for direct-proportional length-based DNA computing.
    Ibrahim Z; Tsuboi Y; Ono O
    IEEE Trans Nanobioscience; 2006 Jun; 5(2):103-9. PubMed ID: 16805106
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 4. DNA computation model to solve 0-1 programming problem.
    Zhang F; Yin Z; Liu B; Xu J
    Biosystems; 2004; 74(1-3):9-14. PubMed ID: 15125989
    [TBL] [Abstract][Full Text] [Related]  

  • 5. A mathematical formulation of DNA computation.
    Zhang M; Cheng MX; Tarn TJ
    IEEE Trans Nanobioscience; 2006 Mar; 5(1):32-40. PubMed ID: 16570871
    [TBL] [Abstract][Full Text] [Related]  

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

  • 7. Solving traveling salesman problems with DNA molecules encoding numerical values.
    Lee JY; Shin SY; Park TH; Zhang BT
    Biosystems; 2004 Dec; 78(1-3):39-47. PubMed ID: 15555757
    [TBL] [Abstract][Full Text] [Related]  

  • 8. A fractional programming approach to efficient DNA melting temperature calculation.
    Leber M; Kaderali L; Schönhuth A; Schrader R
    Bioinformatics; 2005 May; 21(10):2375-82. PubMed ID: 15769839
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 11. Electronic microarrays in DNA computing.
    Akin HE; Karabay DA; Kyle JR; Mills AP; Ozkan CS; Ozkan M
    J Nanosci Nanotechnol; 2011 Jun; 11(6):4717-23. PubMed ID: 21770097
    [TBL] [Abstract][Full Text] [Related]  

  • 12. A design of a parallel architecture for solving exact matching problem on DNA molecules.
    Khaled H; Faheem HM; Hasan T; Ghoneimy S
    Biomed Sci Instrum; 2007; 43():170-5. PubMed ID: 17487076
    [TBL] [Abstract][Full Text] [Related]  

  • 13. The general form of 0-1 programming problem based on DNA computing.
    ZhiXiang Y; Fengyue Z; Jin X
    Biosystems; 2003 Jun; 70(1):73-8. PubMed ID: 12753938
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Reconstruction of DNA sequencing by hybridization.
    Zhang JH; Wu LY; Zhang XS
    Bioinformatics; 2003 Jan; 19(1):14-21. PubMed ID: 12499288
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Principal component analysis of DNA oligonucleotide structural data.
    Bharanidharan D; Gautham N
    Biochem Biophys Res Commun; 2006 Feb; 340(4):1229-37. PubMed ID: 16414352
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Fast and quantitative differentiation of single-base mismatched DNA by initial reaction rate of catalytic hairpin assembly.
    Li C; Li Y; Xu X; Wang X; Chen Y; Yang X; Liu F; Li N
    Biosens Bioelectron; 2014 Oct; 60():57-63. PubMed ID: 24768863
    [TBL] [Abstract][Full Text] [Related]  

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

  • 18. Solution of a 20-variable 3-SAT problem on a DNA computer.
    Braich RS; Chelyapov N; Johnson C; Rothemund PW; Adleman L
    Science; 2002 Apr; 296(5567):499-502. PubMed ID: 11896237
    [TBL] [Abstract][Full Text] [Related]  

  • 19. A new DNA computing model for the NAND gate based on induced hairpin formation.
    Liu W; Shi X; Zhang S; Liu X; Xu J
    Biosystems; 2004 Nov; 77(1-3):87-92. PubMed ID: 15527948
    [TBL] [Abstract][Full Text] [Related]  

  • 20. DNA-based computing of strategic assignment problems.
    Shu JJ; Wang QW; Yong KY
    Phys Rev Lett; 2011 May; 106(18):188702. PubMed ID: 21635133
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.