Applying DNA computation to intractable problems in social network analysis-Reference-Cited by-同舟云学术

Applying DNA computation to intractable problems in social network analysis

Published:2010-09 Issue:3 Volume:101 Page:222-232
ISSN:0303-2647
Container-title:Biosystems
language:en
Short-container-title:Biosystems

Author:

Chen Rick C.S.,Yang Stephen J.H.

Publisher

Elsevier BV

Subject

Applied Mathematics,General Biochemistry, Genetics and Molecular Biology,Modelling and Simulation,General Medicine,Statistics and Probability

Reference24 articles.

1. Molecular computation of solutions to combinatorial problems;Adleman;Science,1994

2. Theoretical and Experimental DNA Computation;Amos,2004

3. Can programming be liberated from the von Neumann style?;Backus,1977

4. Novel approaches for analyzing biological networks;Balasundaram;Journal of Combinatorial Optimization,2005

5. Balasundaram, B., Butenko, S., Hicks, I.V., Sachdeva, S., 2008. Clique relaxations in social network analysis: the maximum k-plex problem. Manuscript.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Study on the Spatial Association Network of CO2 Emissions from the Perspective of City Size: Evidence from the Yangtze River Delta Urban Agglomeration;Buildings;2022-05-07

2. A general resolution of intractable problems in polynomial time through DNA Computing;Biosystems;2016-12

3. DNA based computing for understanding complex shapes;Biosystems;2014-03

4. Biomolecular computation with molecular beacons for quantitative analysis of target nucleic acids;Biosystems;2013-01

5. Relationships of swarm intelligence and artificial immune system;International Journal of Bio-Inspired Computation;2013