Applying DNA computation to intractable problems in social network analysis.
From ancient times to the present day, social networks have played an important role in the formation of various organizations for a range of social behaviors. As such, social networks inherently describe the complicated relationships between elements around the world. Based on mathematical graph theory, social network analysis (SNA) has been developed in and applied to various fields such as Web 2.0 for Web applications and product developments in industries, etc. However, some definitions of SNA, such as finding a clique, N-clique, N-clan, N-club and K-plex, are NP-complete problems, which are not easily solved via traditional computer architecture. These challenges have restricted the uses of SNA. This paper provides DNA-computing-based approaches with inherently high information density and massive parallelism. Using these approaches, we aim to solve the three primary problems of social networks: N-clique, N-clan, and N-club. Their accuracy and feasible time complexities discussed in the paper will demonstrate that DNA computing can be used to facilitate the development of SNA.
Chen
Rick C S
RC
Department of Computer Science & Information Engineering, National Central University, Taiwan.
Yang
Stephen J H
SJ
D000465:Algorithms; D003198:Computer Simulation; D039301:Computers, Molecular; D008962:Models, Theoretical; D012944:Social Support; D049490:Systems Biology / Q000379:methods*