Searching and Inferring Colorful Topological Motifs in Vertex-Colored Graphs
| Autor: | Fábio Viduani Martinez, Diego P. Rubert, Jens Stoye, Eloi Araujo, Marco A. Stefanes |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2020 |
| Předmět: |
Random graph
Control and Optimization Computational complexity theory Efficient algorithm Computer science Applied Mathematics Colored graph Probabilistic logic Topology Computer Science Applications Computational Theory and Mathematics Theory of computation Discrete Mathematics and Combinatorics Motif (music) Biological network |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|