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.


Pubmed for Handhelds

PUBMED FOR HANDHELDS

Journal Abstract Search

142 related items for PubMed ID: 14632435

  • 1. Solving the 3-SAT problem based on DNA computing.
    Liu W, Gao L, Liu X, Wang S, Xu J.
    J Chem Inf Comput Sci; 2003; 43(6):1872-5. PubMed ID: 14632435
    [Abstract] [Full Text] [Related]

  • 2. 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
    [Abstract] [Full Text] [Related]

  • 3.
    ; . PubMed ID:
    [No Abstract] [Full Text] [Related]

  • 4.
    ; . PubMed ID:
    [No Abstract] [Full Text] [Related]

  • 5.
    ; . PubMed ID:
    [No Abstract] [Full Text] [Related]

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

  • 7.
    ; . PubMed ID:
    [No Abstract] [Full Text] [Related]

  • 8. 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
    [Abstract] [Full Text] [Related]

  • 9. Decision making with an interpretive structural modeling method using a DNA-based algorithm.
    Kim I, Watada J.
    IEEE Trans Nanobioscience; 2009 Jun; 8(2):181-91. PubMed ID: 19497835
    [Abstract] [Full Text] [Related]

  • 10.
    ; . PubMed ID:
    [No Abstract] [Full Text] [Related]

  • 11.
    ; . PubMed ID:
    [No Abstract] [Full Text] [Related]

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

  • 13. A DNA computing readout operation based on structure-specific cleavage.
    Wang L, Hall JG, Lu M, Liu Q, Smith LM.
    Nat Biotechnol; 2001 Nov; 19(11):1053-9. PubMed ID: 11689851
    [Abstract] [Full Text] [Related]

  • 14.
    ; . PubMed ID:
    [No Abstract] [Full Text] [Related]

  • 15.
    ; . PubMed ID:
    [No Abstract] [Full Text] [Related]

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

  • 17. Fast exact algorithms for the closest string and substring problems with application to the planted (L, d)-motif model.
    Chen ZZ, Wang L.
    IEEE/ACM Trans Comput Biol Bioinform; 2011 Oct 31; 8(5):1400-10. PubMed ID: 21282867
    [Abstract] [Full Text] [Related]

  • 18.
    ; . PubMed ID:
    [No Abstract] [Full Text] [Related]

  • 19.
    ; . PubMed ID:
    [No Abstract] [Full Text] [Related]

  • 20.
    ; . PubMed ID:
    [No Abstract] [Full Text] [Related]

    Page: [Next] [New Search]
    of 8.