Computing subgraph frequencies is a fundamental task that lies at the core of several
network analysis methodologies, such as network motifs and graphlet-based metrics, which …

Despite considerable progress in genome-and proteome-based high-throughput screening
methods and in rational drug design, the increase in approved drugs in the past decade did …

Medical artificial intelligence (AI) systems have been remarkably successful, even
outperforming human performance at certain tasks. There is no doubt that AI is important to …

In this paper, we study the problem of subgraph matching that extracts all subgraph
isomorphic embeddings of a query graph q in a large data graph G. The existing algorithms …

Subgraph matching (or subgraph isomorphism) is one of the fundamental problems in graph
analysis. Extensive research has been done to develop practical solutions for subgraph …

Motivation: Analogous to biological sequence comparison, comparing cellular networks is
an important problem that could provide insight into biological understanding and …

Subgraph matching finds all distinct isomorphic embeddings of a query graph on a data
graph. For large graphs, current solutions face the scalability challenge due to expensive …

Motivation: Small-induced subgraphs called graphlets are emerging as a possible tool for
exploration of global and local structure of networks and for analysis of roles of individual …

Availability of large-scale experimental data for cell biology is enabling computational
methods to systematically model the behaviour of cellular networks. This review surveys the …

Sequence comparison and alignment has had an enormous impact on our understanding of
evolution, biology and disease. Comparison and alignment of biological networks will …