Solving application oriented graph theoretical problems with DNA computing

被引：0

作者：

Halasz, Veronika ^{[1
]}

Hegedues, Laszlo ^{[1
]}

Hornyak, Istvan ^{[1
]}

Nagy, Benedek ^{[2
]}

机构：

[1] Univ Debrecen, Fac Informat, Debrecen, Hungary

[2] Univ Debrecen, Fac Informat, Dept Comp Sci, Debrecen, Hungary

来源：

PROCEEDINGS OF SEVENTH INTERNATIONAL CONFERENCE ON BIO-INSPIRED COMPUTING: THEORIES AND APPLICATIONS (BIC-TA 2012), VOL 1 | 2013年 / 201卷

关键词：

DNA computing; Graph algorithms; Bipartite graphs; DNA algorithm; Networks; Social network; Bioinformatics; NETWORKS;

D O I：

10.1007/978-81-322-1038-2_7

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Social networks are represented by graphs. Important features of the network, e.g., length of shortest paths, centrality, are given by graph theoretical way. Bipartite graphs are used to represent various problems, for example, in medicine or in economy. The relations between customers and goods can be represented by bipartite graphs. Genes and various diseases can also form a bipartite graph, where a disease is connected to those genes that could cause it. In this paper DNA computing approach is presented for solving some graph theoretical problems. Since DNA computing uses a massively parallel approach, hard graph theoretical problems can be solved (at least in theory). Our main contribution is to present Projection algorithms for bipartite graphs; the molecular tube obtained by them can be used as a base for further processes.

引用

页码：75 / +

页数：2

共 12 条

[1] MOLECULAR COMPUTATION OF SOLUTIONS TO COMBINATORIAL PROBLEMS [J].