Finding Short Linear Motifs in Protein Interaction Networks
Author Information
Author(s): Tan Soon-Heng, Hugo Willy, Sung Wing-Kin, Ng See-Kiong
Primary Institution: Institute for Infocomm Research, Singapore
Hypothesis
Can correlated motifs be effectively discovered from protein-protein interaction data without prior knowledge of protein groupings?
Conclusion
The correlated motif approach can successfully identify linear motifs from sparse and noisy interaction data, aiding in the discovery of novel binding motifs.
Supporting Evidence
- D-STAR extracted motifs that corresponded to actual interacting subsequences in biological datasets.
- The approach eliminated the need for prior protein grouping, making it more robust against noise.
- Evaluation on simulated data showed that D-STAR outperformed existing algorithms in motif extraction.
Takeaway
This study shows a new way to find important patterns in proteins that help them interact, which can be useful for understanding diseases.
Methodology
The study used a novel algorithm called D-STAR to find correlated motifs from protein interaction data without needing prior knowledge of protein groupings.
Limitations
The approach may not work well if one of the correlated motifs is structural rather than linear.
Statistical Information
P-Value
<0.001
Statistical Significance
p<0.001
Digital Object Identifier (DOI)
Want to read the original?
Access the complete publication on the publisher's website