Applying DNA computation to intractable problems in social network analysis

NCU Institutional Repository > 資訊電機學院 > 資訊工程學系 > 期刊論文 > Item 987654321/51525

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/51525

题名:	Applying DNA computation to intractable problems in social network analysis
作者:	Chen,RCS;Yang,SJH
贡献者:	資訊工程學系
关键词:	MATRIX
日期:	2010
上传时间:	2012-03-27 18:55:17 (UTC+8)
出版者:	國立中央大學
摘要:	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.
關聯:	BIOSYSTEMS
显示于类别:	[資訊工程學系] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	402	检视/开启

在NCUIR中所有的数据项都受到原著作权保护.

社群 sharing