Identifying protein complexes directly from high-throughput TAP data with Markov random fields
W. Rungsarityotin, R. Krause, A. Schödl and A. Schliep
BMC Bioinformatics 2007, 8, 482.
BACKGROUND: Predicting protein complexes from experimental data remains a challenge due to limited resolution and stochastic errors of high-throughput methods. Current algorithms to reconstruct the complexes typically rely on a two-step process. First, they construct an interaction graph from the data, predominantly using heuristics, and subsequently cluster its vertices to identify protein complexes. RESULTS: We propose a model-based identification of protein complexes directly from the experimental observations. Our model of protein complexes based on Markov random fields explicitly incorporates false negative and false positive errors and exhibits a high robustness to noise. A model-based quality score for the resulting clusters allows us to identify reliable predictions in the complete data set. Comparisons with prior work on reference data sets shows favorable results, particularly for larger unfiltered data sets. Additional information on predictions, including the source code under the GNU Public License can be found at http://algorithmics.molgen.mpg.de/Static/Supplements/ProteinComplexes. CONCLUSION: We can identify complexes in the data obtained from high-throughput experiments without prior elimination of proteins or weak interactions. The few parameters of our model, which does not rely on heuristics, can be estimated using maximum likelihood without a reference data set. This is particularly important for protein complex studies in organisms that do not have an established reference frame of known protein complexes.
Supplementary information is available at https://schlieplab.org/Static/Supplements/ProteinComplexes/. A reprint is available as PDF.
Pubmed ID: 18093306.
The publication includes results from the following projects or software tools: ProteinComplexes.