Table 2 Rules
From: Improved multi-level protein–protein interaction prediction with semantic-based regularization
Name | Definition |
|---|---|
P →D | ∀(p,p’) hasdom(p) ∧hasdom(p’) ⇒ |
boundp(p,p’) ⇒ ∃(d,d’) boundd(d,d’) ∧parentpd(p,d) ∧parentpd(p’,d’) | |
D →P | ∀(p,p’) ∃(d,d’) |
boundd(d,d’) ∧parentpd(p,d) ∧parentpd(p’,d’) ⇒boundp(p,p’) | |
D →R | ∀(d,d’) hasres(d) ∧hasres(d’) ⇒ |
boundd(d,d’) ⇒ ∃ n (r,r’) boundr(r,r’) ∧parentdr(d,r) ∧parentdr(d’,r’) | |
R →D | ∀(d,d’) ∃(r,r’) |
boundr(r,r’) ∧parentdr(d,r) ∧parentdr(d’,r’) ⇒boundd(d,d’) | |
P →R | Same as D →R, with proteins in place of domains |
R →P | Same as R →D, with proteins in place of domains |