Partitioning a PPI Network into Overlapping Modules Constrained by High-Density and Periphery Tracking

<table>Plot of the number of clusters generated by DPClusO with respect to maximum overlapping. <svg height="14.7125" id="M67" style="vertical-align:-3.22282pt" version="1.1" viewbox="0 0 45.799999 14.7125" width="45.799999" xmlns="http://www.w3.org/2000/svg">
<g transform="matrix(1.25,0,0,-1.25,0,14.7125)">
<g transform="translate(72,-60.23)">
<text transform="matrix(1,0,0,-1,-71.95,63.5)">
<tspan style="font-size: 12.50px; " x="0" y="0">O</tspan>
<tspan style="font-size: 12.50px; " x="9.0271664" y="0">V</tspan>
</text>
<text transform="matrix(1,0,0,-1,-53.9,60.37)">
<tspan style="font-size: 8.75px; " x="0" y="0">m</tspan>
<tspan style="font-size: 8.75px; " x="6.8090558" y="0">a</tspan>
<tspan style="font-size: 8.75px; " x="10.694944" y="0">x</tspan>
</text>
</g>
</g>
</svg> = 0 means all modules are completely nonoverlapping. For other points <svg height="14.7125" id="M68" style="vertical-align:-3.22282pt" version="1.1" viewbox="0 0 45.799999 14.7125" width="45.799999" xmlns="http://www.w3.org/2000/svg">
<g transform="matrix(1.25,0,0,-1.25,0,14.7125)">
<g transform="translate(72,-60.23)">
<text transform="matrix(1,0,0,-1,-71.95,63.5)">
<tspan style="font-size: 12.50px; " x="0" y="0">O</tspan>
<tspan style="font-size: 12.50px; " x="9.0271664" y="0">V</tspan>
</text>
<text transform="matrix(1,0,0,-1,-53.9,60.37)">
<tspan style="font-size: 8.75px; " x="0" y="0">m</tspan>
<tspan style="font-size: 8.75px; " x="6.8090558" y="0">a</tspan>
<tspan style="font-size: 8.75px; " x="10.694944" y="0">x</tspan>
</text>
</g>
</g>
</svg> indicates the maximum overlapping score between any two modules.</table>

International Scholarly Research Notices

fig2

Figure 2

Figure 2: Partitioning a PPI Network into Overlapping Modules Constrained by High-Density and Periphery Tracking 