Khor, Susan (2014) Inferring Domain-Domain Interactions from Protein-Protein Interactions with Formal Concept Analysis. PLoS ONE, 9 (2). ISSN 1932-6203
PDF (Migrated (PDF/A Conversion) from original format: (application/pdf))
- Published Version
Available under License Creative Commons Attribution Non-commercial.
Identifying reliable domain-domain interactions will increase our ability to predict novel protein-protein interactions, to unravel interactions in protein complexes, and thus gain more information about the function and behavior of genes. One of the challenges of identifying reliable domain-domain interactions is domain promiscuity. Promiscuous domains are domains that can occur in many domain architectures and are therefore found in many proteins. This becomes a problem for a method where the score of a domain-pair is the ratio between observed and expected frequencies because the protein-protein interaction network is sparse. As such, many protein-pairs will be non-interacting and domain-pairs with promiscuous domains will be penalized. This domain promiscuity challenge to the problem of inferring reliable domain-domain interactions from protein-protein interactions has been recognized, and a number of work-arounds have been proposed. This paper reports on an application of Formal Concept Analysis to this problem. It is found that the relationship between formal concepts provides a natural way for rare domains to elevate the rank of promiscuous domain-pairs and enrich highly ranked domain-pairs with reliable domain-domain interactions. This piggybacking of promiscuous domain-pairs onto less promiscuous domain-pairs is possible only with concept lattices whose attribute-labels are not reduced and is enhanced by the presence of proteins that comprise both promiscuous and rare domains.
|Additional Information:||Memorial University Open Access Author's Fund|
|Department(s):||Science, Faculty of > Computer Science|
|Date:||19 February 2014|
Actions (login required)