Help Guide Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse




Journal Article

Algorithms for protein interaction networks


Lappe,  M.
Independent Junior Research Groups (OWL), Max Planck Institute for Molecular Genetics, Max Planck Society;

There are no locators available
Fulltext (public)

(Any fulltext), 334KB

Supplementary Material (public)
There is no public supplementary material available

Lappe, M., & Holm, L. (2005). Algorithms for protein interaction networks. Biochemical Society Transactions, 33(3), 530-534.

Cite as:
The functional characterization of all genes and their gene products is the main challenge of the postgenomic era. Recent experimental and computational techniques have enabled the study of interactions among all proteins on a large scale. In this paper, approaches will be presented to exploit interaction information for the inference of protein structure, function, signalling pathways and ultimately entire interactomes. Interaction networks can bemodelled as graphs, showing the operation of gene function in terms of protein interactions. Since the architecture of biological networks differs distinctly from random networks, these functional maps contain a signal that can be used for predictive purposes. Protein function and structure can be predicted by matching interaction patterns, without the requirement of sequence similarity. Moving on to a higher level definition of protein function, the question arises how to decompose complex networks into meaningful subsets. An algorithm will be demonstrated, which extracts whole signal-transduction pathways from noisy graphs derived from text-mining the biological literature. Finally, an algorithmic strategy is formulated that enables the proteomics community to build a reliable scaffold of the interactome in a fraction of the time compared with uncoordinated efforts.