Computational discovery of direct associations between GO terms and protein domains.

ABSTRACT:

Background

Families of related proteins and their different functions may be described systematically using common classifications and ontologies such as Pfam and GO (Gene Ontology), for example. However, many proteins consist of multiple domains, and each domain, or some combination of domains, can be responsible for a particular molecular function. Therefore, identifying which domains should be associated with a specific function is a non-trivial task.

Results

We describe a general approach for the computational discovery of associations between different sets of annotations by formalising the problem as a bipartite graph enrichment problem in the setting of a tripartite graph. We call this approach "CODAC" (for COmputational Discovery of Direct Associations using Common N

SUBMITTER: Alborzi SZ 

PROVIDER: S-EPMC6245584 | biostudies-literature | 2018 Nov

REPOSITORIES: biostudies-literature