Figure 4

Graph Creation. The present pseudo code describes different steps to transform motif-architecture information into a graph structure in a suggestively way. The first step deals with the creation of a parent-child relationship mapped by the common composite pattern. Here, each child is the immediately consecutive motif of the previous within a sequence. The next step handles the final resulting composite which has been traversed and returns all possible paths with our strictly defined size of four consecutive motifs. A motif-architecture was born and transferred into a graph. A representative motif as node will be inserted if the node does not exist or updated if it exists in the graph. The corresponding edge of two nodes will be updated by increasing by one if this connection already exists. This leads to one graph for each ‘TM’ region. All ‘TM’ sub-graphs will be merged into one main graph.