Applying DNA computation to intractable problems in social network analysis

NCUIR > College of Electrical Engineering & Computer Science > Department of Computer Science and information Engineering > journal & Dissertation > Item 987654321/51525

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/51525

Title:	Applying DNA computation to intractable problems in social network analysis
Authors:	Chen,RCS;Yang,SJH
Contributors:	資訊工程學系
Keywords:	MATRIX
Date:	2010
Issue Date:	2012-03-27 18:55:17 (UTC+8)
Publisher:	國立中央大學
Abstract:	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. (C) 2010 Elsevier Ireland Ltd. All rights reserved.
Relation:	BIOSYSTEMS
Appears in Collections:	[Department of Computer Science and information Engineering] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	391	View/Open

社群 sharing

Loading...