They are implemented for two different graph problems: calculation of single source shortest paths (SSSP) and collective classification of graph nodes by means of relational influence propagation (RIP).
Among them, Greedy-extension is the implementation of string-based method, while De Bruijn graph and overlap-layout-consensus (OLC) are two different graph-based approaches.
GNA formulates alignment as two different graph matching problems depending on whether strict constraints on protein matches based on sequence similarity are given, or whether an optimal compromise between sequence similarity and interaction conservation in the alignment is desired.
The HRM profiles consist of three different graphs (melt temperature, normalized graph and the difference graph) that are visualized all together during the analysis of results.
Three different graphs are defined to capture the geometric properties of the data-set.
There are eight different graphs (6a, b, c, d, e, f, g, h) arranged in an array with two columns and four rows.
Conditional independence graphs were constructed for the two ecotypes in each lake, generating a total of four different graphs.
