Skip to main content
. 2016 Mar 7;7:11. doi: 10.1186/s13326-016-0052-6

Fig. 1.

Fig. 1

Illustration of the all-path graph representation. The candidate interaction pair is marked as “Enzyme1” and “Drug1”. The shortest path between the enzyme and the drug is shown in bold. In the dependency based sub-graph (a), all nodes in the shortest path are specialized using a post-tag (IP). In the linear order subgraph (b), possible tags are (B)efore, (M)iddle, and (A)fter