共 35 条
Graph-theory Based Simplification Techniques for Efficient Biological Network Analysis
被引:4
|作者:
Ko, Euiseong
[1
]
Kang, Mingon
[1
]
Chang, Hyung Jae
[2
]
Kim, Donghyun
[1
]
机构:
[1] Kennesaw State Univ, Dept Comp Sci, Marietta, GA 30060 USA
[2] Troy Univ Montgomery, Dept Comp Sci, Montgomery, AL USA
来源:
2017 THIRD IEEE INTERNATIONAL CONFERENCE ON BIG DATA COMPUTING SERVICE AND APPLICATIONS (IEEE BIGDATASERVICE 2017)
|
2017年
关键词:
Biological Network Analysis;
Graph Algorithm;
Greedy Algorithm;
Optimization;
PROTEIN INTERACTION NETWORKS;
GENE-EXPRESSION;
INFERENCE;
D O I:
10.1109/BigDataService.2017.39
中图分类号:
TP [自动化技术、计算机技术];
学科分类号:
0812 ;
摘要:
The recent years have witnessed the remarkable expansion of publicly available biological data in the related research fields. Many researches in these fields often require massive data to be analyzed by utilizing high-throughput sequencing technologies. However, it is very challenging to interpret the data efficiently due to it high complexity. This paper introduces two new graph algorithms which aim to improve the efficiency of the existing methods for biological network data interpretation. In particular, the algorithms focus on the problem of how to simplify gene regulatory networks so that many existing algorithms can efficiently discover important connected components of a biological system in their own context as many times as they need. The performance of the proposed algorithms is compared with each other with gene expression data of glioblastoma brain tumor cancer.
引用
收藏
页码:277 / 280
页数:4
相关论文