for “ RESQUE : Network reduction using semi - Markov random walk scores for efficient querying of biological networks ”

Here, we want to show that the proposed reduction scheme improves the expected accuracy of the querying result. Let A represent the space of all possible matchings between the query and the target networks, where a matching a uniquely maps the query nodes VQ to a subgraph region in the target network. Besides, let a∗ be the (unknown) matching from A that most nearly represents the true biological querying result of GQ in G. Here, we seek an scheme that yields a matching a ∈ A that maximizes the accuracy of the querying result, which we define with respect to a∗ as: accuracy(a, a∗) = 1 NQ ∑