
TL;DR
This paper investigates how graph coloring can be applied to biological networks, revealing that disassortative PPI networks require fewer colors, which may enhance cellular multitasking, and that coloring info can improve protein complex detection.
Contribution
It demonstrates the relationship between graph coloring and biological network properties, and shows how coloring can improve protein complex identification methods.
Findings
Disassortative networks need fewer colors for coloring.
Fewer colors imply higher concurrency potential in networks.
Coloring information enhances protein complex detection quality.
Abstract
We explore the application of graph coloring to biological networks, specifically protein-protein interaction (PPI) networks. First, we find that given similar conditions (i.e. number of nodes, number of links, degree distribution and clustering), fewer colors are needed to color disassortative (high degree nodes tend to connect to low degree nodes and vice versa) than assortative networks. Fewer colors create fewer independent sets which in turn imply higher concurrency potential for a network. Since PPI networks tend to be disassortative, we suggest that in addition to functional specificity and stability proposed previously by Maslov and Sneppen (Science 296, 2002), the disassortative nature of PPI networks may promote the ability of cells to perform multiple, crucial and functionally diverse tasks concurrently. Second, since graph coloring is closely related to the presence of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
