Skip to main content
. 2013 Jun 13;8(6):e65814. doi: 10.1371/journal.pone.0065814

Figure 1. Graph representation generated from an example sentence.

Figure 1

The candidate interaction pair is marked as “drug1” and “drug2”, the other drugs are marked as “drug0”. The shortest path between the drugs is shown in bold. In the dependency based subgraph all nodes in a shortest path are specialized using a post-tag (IP). In the linear order subgraph possible tags are (B)efore, (M)iddle, and (A)fter.