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 *

113 related articles for article (PubMed ID: 27323370)

  • 1. Parallel DNA Arithmetic Operation With One Error Detection Based on 3-Moduli Set.
    Zheng X; Wang B; Zhou C; Wei X; Zhang Q
    IEEE Trans Nanobioscience; 2016 Jul; 15(5):499-507. PubMed ID: 27323370
    [TBL] [Abstract][Full Text] [Related]  

  • 2. DNA Arithmetic With Error Correction.
    Famoori F; Molahosseini AS; Zarandi AAE
    IEEE Trans Nanobioscience; 2023 Apr; 22(2):329-336. PubMed ID: 35816540
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

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

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

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

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

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

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

  • 13. Error-free parallel rational arithmetic for optical and VLSI computing.
    Krishnamurthy EV; Murthy VK
    Appl Opt; 1987 Nov; 26(22):4819-22. PubMed ID: 20523453
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Design of a DNA-based reversible arithmetic and logic unit.
    Sarker A; Hasan Babu HM; Rashid SM
    IET Nanobiotechnol; 2015 Aug; 9(4):226-38. PubMed ID: 26224353
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 18. DNA based arithmetic function: a half adder based on DNA strand displacement.
    Li W; Zhang F; Yan H; Liu Y
    Nanoscale; 2016 Feb; 8(6):3775-84. PubMed ID: 26814628
    [TBL] [Abstract][Full Text] [Related]  

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

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

    [Next]    [New Search]
    of 6.