From post

Solution to Satisfiability Problem Based on Molecular Beacon Microfluidic Chip Computing Model.

, , , , и . BIC-TA (1), том 1565 из Communications in Computer and Information Science, стр. 415-425. Springer, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Searching for Maximum Clique by DNA Origami., , , и . ICNC-FSKD, стр. 167-172. IEEE, (2018)Probe Machine Based Computing Model for Solving Satisfiability Problem., , , , и . BIC-TA (2), том 1160 из Communications in Computer and Information Science, стр. 79-92. Springer, (2019)Molecular Computation: Solving 3-Vertex-Colourability Problem., , и . ICIC (3), том 2 из Communications in Computer and Information Science, стр. 450-458. Springer, (2007)DNA Computing Model of the Integer Linear Programming Problem Based on Molecular Beacon., , , и . ICIC (3), том 4115 из Lecture Notes in Computer Science, стр. 238-247. Springer, (2006)Evolutionary Model for Sequence Generation., , , и . ICIC (1), том 4681 из Lecture Notes in Computer Science, стр. 10-17. Springer, (2007)A Surface-Based DNA Computing for the Positive Integer Linear Programming Problem., , и . ICIC (1), том 4681 из Lecture Notes in Computer Science, стр. 1-9. Springer, (2007)The Design of RNA Biosensors Based on Nano-Gold and Magnetic Nanoparticles., , и . BIC-TA, том 791 из Communications in Computer and Information Science, стр. 320-328. Springer, (2017)The Chinese Postman Problem Based on Molecular Beacon Strand Displacement., , , и . ICNC-FSKD, стр. 519-523. IEEE, (2018)The Chinese Postman Problem Based on the Probe Machine Model., , , , и . BIC-TA (2), том 952 из Communications in Computer and Information Science, стр. 55-62. Springer, (2018)Maximum Weight Clique Problem Based on Sticker Model., , , и . ICNC (6), стр. 171-175. IEEE Computer Society, (2009)