Big Chemical Encyclopedia

Chemical substances, components, reactions, process design ...

Articles Figures Tables About

Prediction of Higher Order Function

Prediction of Higher Order Function A. Graph Comparison [Pg.396]

Let G be a labeled graph defined by a finite set of nodes V and a finite set of edges E  [Pg.397]

Let us find the optimal local similarity, or the maximum common subgraph, of two graphs  [Pg.397]

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  [Pg.402]

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. [Pg.403]


See other pages where Prediction of Higher Order Function is mentioned: [Pg.381]    [Pg.498]   


SEARCH



Functional prediction

Of higher-order

Predicting function

© 2024 chempedia.info