Skip to main content


Figure 2 | BMC Bioinformatics

Figure 2

From: Extraction of relations between genes and diseases from text and large-scale data analysis: implications for translational research

Figure 2

Dependency graph representation of a gene-disease association. a) Dependency graph representation of the sentence. Solid lines represent the shortest path between the two candidates. The token “associated” is the Least Common Subsumer (LCS) node of both candidates. b) Subgraph representing the shortest path between EHD3 and MDD, where syntactic dependencies are represented as edges and tokens as nodes. c) The e-walk and v-walk features for the node “association” and the syntactic (token, stem, lemma, POS) and semantic features (role) considered in the K DEP kernel.

Back to article page