KEGGSum: Summarizing Genomic Pathways

被引:1
作者
David, Chaim [1 ]
Kondylakis, Haridimos [2 ,3 ]
机构
[1] Hellen Open Univ, Dept Sci & Technol, Patras 26335, Greece
[2] Univ Crete, Comp Sci Dept, Iraklion 70013, Greece
[3] FORTH ICS, Iraklion 70013, Greece
关键词
summaries; KEGG graphs; pathways;
D O I
10.3390/info15010056
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Over time, the renowned Kyoto Encyclopedia of Genes and Genomes (KEGG) has grown to become one of the most comprehensive online databases for biological procedures. The majority of the data are stored in the form of pathways, which are graphs that depict the relationships between the diverse items participating in biological procedures, such as genes and chemical compounds. However, the size, complexity, and diversity of these graphs make them difficult to explore and understand, as well as making it difficult to extract a clear conclusion regarding their most important components. In this regard, we present KEGGSum, a system enabling the efficient and effective summarization of KEGG pathways. KEGGSum receives a KEGG identifier (Kid) as an input, connects to the KEGG database, downloads a specialized form of the pathway, and determines the most important nodes in the graph. To identify the most important nodes in the KEGG graphs, we explore multiple centrality measures that have been proposed for generic graphs, showing their applicability to KEGG graphs as well. Then, we link the selected nodes in order to produce a summary graph out of the initial KEGG graph. Finally, our system visualizes the generated summary, enabling an understanding of the most important parts of the initial graph. We experimentally evaluate our system, and we show its advantages and benefits.
引用
收藏
页数:16
相关论文
共 25 条
[1]  
BAVELAS A, 1950, The journal of the acoustical society of America, V22, P723, DOI DOI 10.1121/1.1906679
[2]  
Bloch F, 2016, Social Choice and Welfare, DOI DOI 10.2139/SSRN.2749124
[3]   Axioms for Centrality [J].
Boldi, Paolo ;
Vigna, Sebastiano .
INTERNET MATHEMATICS, 2014, 10 (3-4) :222-262
[4]   Summarizing semantic graphs: a survey [J].
Cebiric, Sejla ;
Goasdoue, Francois ;
Kondylakis, Haridimos ;
Kotzinos, Dimitris ;
Manolescu, Ioana ;
Troullinou, Georgia ;
Zneika, Mussab .
VLDB JOURNAL, 2019, 28 (03) :295-327
[5]  
Dreyfus S. E., 1972, Networks, V1, P195, DOI 10.1002/net.3230010302
[6]  
Erciyes K., 2021, Discrete Mathematics and Graph Theory. A Concise Study Companion and Guide, DOI [10.1007/978-3-030-61115-6, DOI 10.1007/978-3-030-61115-6]
[7]   SET OF MEASURES OF CENTRALITY BASED ON BETWEENNESS [J].
FREEMAN, LC .
SOCIOMETRY, 1977, 40 (01) :35-41
[8]  
Garg M., 2009, SSRN Electron. J, DOI [10.2139/ssrn.1372441, DOI 10.2139/SSRN.1372441]
[9]  
Gwet KL., 2014, HDB INTERRATER RELIA
[10]   Unsupervised graph-based feature selection via subspace and pagerank centrality [J].
Henni, K. ;
Mezghani, N. ;
Gouin-Vallerand, C. .
EXPERT SYSTEMS WITH APPLICATIONS, 2018, 114 :46-53