Searching and inferring colorful topological motifs in vertex-colored graphs

被引:0
作者
Diego P. Rubert
Eloi Araujo
Marco A. Stefanes
Jens Stoye
Fábio V. Martinez
机构
[1] Universidade Federal de Mato Grosso do Sul,Faculdade de Computação
[2] Bielefeld University,Faculty of Technology and Center for Biotechnology (CeBiTec)
来源
Journal of Combinatorial Optimization | 2020年 / 40卷
关键词
Computational biology; Biological networks; Colorful topological motifs; Frequent motifs in graphs;
D O I
暂无
中图分类号
学科分类号
摘要
The analysis of biological networks allows the understanding of many biological processes, including the structure, function, interaction and evolutionary relationships of their components. One of the most important concepts in biological network analysis is that of network motifs, which are patterns of interconnections that occur in a given network at a frequency higher than expected in a random network. In this work we are interested in searching and inferring network motifs in a class of biological networks that can be represented by vertex-colored graphs. We show the computational complexity for many problems related to colorful topological motifs and present efficient algorithms for special cases. A colorful motif can be represented by a graph in which each vertex has a different color. We also present a probabilistic strategy to detect highly frequent motifs in vertex-colored graphs. Experiments on real data sets show that our algorithms are very competitive both in efficiency and in quality of the solutions.
引用
收藏
页码:379 / 411
页数:32
相关论文
empty
未找到相关数据