Detecting list-colored graph motifs in biological networks using branch-and-bound strategy

摘要: In this work, we study the list-colored graph motif problem, which was introduced to detect functional motifs in biological networks. Given a multi-set M of colors as query and G where each vertex is associated with set colors, aim problem find sub-graph whose colored exactly M. To solve present heuristic method efficiently accurately networks using branch-and-bound strategy. We transform detection search connected induced sub-graphs graph, vertices are assigned distinctive motif. This transformation enables our discover occurrences without enumerating verifying all sub-graphs. Furthermore, new initial selection strategy based on proposed determine scope motifs. Experiments conducted metabolic protein-interaction demonstrate that can achieve better performance accuracy efficiency comparison other existing methods.