Review Article
Applied Graph-Mining Algorithms to Study Biomolecular Interaction Networks
Table 1
A summary of graph comparison methods by the strategy employed.
| Methods | Comparison strategy | Specification | References | Local | Global | Pairwise | Multiple |
| MCS | Distance-based | | x | x | | [10, 11] | Editing distance | Distance-based | | x | x | | [12] | Graphlet | Graphlet | | x | x | | [13] | Fast random walk kernel | Graph kernel | | | x | | [8] | Graphlet kernel | Graph kernel | | | x | | [26] | Fast subtree kernel | Graph kernel | | | x | | [27] | Weighted alignment | Graph alignment | X | | x | | [7] | Substructure-based alignment | Graph alignment | X | | x | | [30] | Class of NetworkBLAST | Graph alignment | X | | x | x | [9, 31–34] | Quadratic programming | Graph alignment | X | | x | | [35] | Class of GRAAL | Graph alignment | | x | x | | [14–16, 38] | Class of Graemlin | Graph alignment | | x | | x | [39, 40] | Class of IsoRank | Graph alignment | | x | | x | [41, 42] | GHOST | Graph alignment | | x | x | | [36] | NETAL | Graph alignment | | x | x | | [37] |
|
|