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)

  • 21. DNA algorithm for an unbounded fan-in Boolean circuit.
    Ahrabian H; Ganjtabesh M; Nowzari-Dalini A
    Biosystems; 2005 Oct; 82(1):52-60. PubMed ID: 15982801
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Is optimal solution of every NP-complete or NP-hard problem determined from its characteristic for DNA-based computing.
    Guo M; Chang WL; Ho M; Lu J; Cao J
    Biosystems; 2005 Apr; 80(1):71-82. PubMed ID: 15740836
    [TBL] [Abstract][Full Text] [Related]  

  • 23. A new fast algorithm for solving the minimum spanning tree problem based on DNA molecules computation.
    Wang Z; Huang D; Meng H; Tang C
    Biosystems; 2013 Oct; 114(1):1-7. PubMed ID: 23871964
    [TBL] [Abstract][Full Text] [Related]  

  • 24. Applying DNA computation to intractable problems in social network analysis.
    Chen RC; Yang SJ
    Biosystems; 2010 Sep; 101(3):222-32. PubMed ID: 20566337
    [TBL] [Abstract][Full Text] [Related]  

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

  • 26. Parallel workflow manager for non-parallel bioinformatic applications to solve large-scale biological problems on a supercomputer.
    Suplatov D; Popova N; Zhumatiy S; Voevodin V; Švedas V
    J Bioinform Comput Biol; 2016 Apr; 14(2):1641008. PubMed ID: 27122320
    [TBL] [Abstract][Full Text] [Related]  

  • 27. A Graph-Based Approach for the DNA Word Design Problem.
    Luncasu V; Raschip M
    IEEE/ACM Trans Comput Biol Bioinform; 2021; 18(6):2747-2752. PubMed ID: 32750888
    [TBL] [Abstract][Full Text] [Related]  

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

  • 29. Digital parity and the composition of the nucleotide alphabet. Shaping the alphabet with error coding.
    MacDónaill DA
    IEEE Eng Med Biol Mag; 2006; 25(1):54-61. PubMed ID: 16485392
    [No Abstract]   [Full Text] [Related]  

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

  • 31. Towards computing with proteins.
    Unger R; Moult J
    Proteins; 2006 Apr; 63(1):53-64. PubMed ID: 16435369
    [TBL] [Abstract][Full Text] [Related]  

  • 32. The surface-based approach for DNA computation is unreliable for SAT.
    Li D; Li X; Huang H; Li X
    Biosystems; 2005 Oct; 82(1):20-5. PubMed ID: 16024166
    [TBL] [Abstract][Full Text] [Related]  

  • 33. A new solution for maximal clique problem based sticker model.
    Darehmiraki M
    Biosystems; 2009 Feb; 95(2):145-9. PubMed ID: 18992786
    [TBL] [Abstract][Full Text] [Related]  

  • 34. High-throughput computing in the sciences.
    Morgan M; Grimshaw A
    Methods Enzymol; 2009; 467():197-227. PubMed ID: 19897094
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Logic circuits based on molecular spider systems.
    Mo D; Lakin MR; Stefanovic D
    Biosystems; 2016 Aug; 146():10-25. PubMed ID: 27085223
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Fast parallel DNA-based algorithms for molecular computation: quadratic congruence and factoring integers.
    Chang WL
    IEEE Trans Nanobioscience; 2012 Mar; 11(1):62-9. PubMed ID: 21914574
    [TBL] [Abstract][Full Text] [Related]  

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

  • 38. Markov chains: computing limit existence and approximations with DNA.
    Cardona M; Colomer MA; Conde J; Miret JM; Miró J; Zaragoza A
    Biosystems; 2005 Sep; 81(3):261-6. PubMed ID: 15982800
    [TBL] [Abstract][Full Text] [Related]  

  • 39. DNA computing of solutions to knapsack problems.
    Henkel CV; Bäck T; Kok JN; Rozenberg G; Spaink HP
    Biosystems; 2007 Mar; 88(1-2):156-62. PubMed ID: 16860927
    [TBL] [Abstract][Full Text] [Related]  

  • 40. Potential for enlarging DNA memory: the validity of experimental operations of scaled-up nested primer molecular memory.
    Kashiwamura S; Yamamoto M; Kameda A; Shiba T; Ohuchi A
    Biosystems; 2005 Apr; 80(1):99-112. PubMed ID: 15740839
    [TBL] [Abstract][Full Text] [Related]  

    [Previous]   [Next]    [New Search]
    of 8.