Gesellschaft für Informatik e.V.

Lecture Notes in Informatics

German Conference on Bioinformatics P-136, 30-43 (2008).

Gesellschaft für Informatik, Bonn


Andreas Beyer (ed.), Michael Schroeder (ed.)

Copyright © Gesellschaft für Informatik, Bonn


Identifying the topology of protein complexes from affinity purification assays

Caroline C. Friedel and Ralf Zimmer


Recent advances in high-throughput technologies have made it possible to investigate not only individual protein interactions but the association of these proteins in complexes. So far the focus has been on the prediction of complexes as sets of proteins from the experimental results while the modular substructure and the physical interactions within protein complexes have been mostly ignored. In this article, we present an approach for identifying the direct physical interactions and the subcomponent structure of protein complexes predicted from affinity purification assays. Our algorithm calculates the union of all maximum spanning trees from scoring networks for each protein complex to extract relevant interactions. In a subsequent step this network is extended to interactions which are not accounted for by alternative indirect paths. We show that the interactions identified with this approach are more accurate in predicting experimentally derived physical interactions than baseline approaches and resolve more satisfactorily the subcomponent structure of the complexes. The usefulness of our approach is illustrated on the RNA polymerases for which the modular substructure can be successfully reconstructed with our method.

Full Text: PDF

Gesellschaft für Informatik, Bonn
ISBN 978-3-88579-226-0

Last changed 04.10.2013 18:19:00