Prediction of Higher Order Function

Prediction of Higher Order Function A. Graph Comparison 

Let G be a labeled graph defined by a finite set of nodes V and a finite set of edges E  

Let us find the optimal local similarity, or the maximum common subgraph, of two graphs  

The path computation problem is formulated in terms of logic programming (Goto et al., 1997). The binary relation of X and Tis a fact denoted by  

Here the relations X-Fand X-Zmight represent experimental evidence on protein-protein interactions, whereas the relations Z—G and G—Y result from computational analysis of sequence similarity. In this way, different types of binary relations (cf., Table V) can be incorporated in a formalism of path computation. 

---