Motif mining based on network space compression

Table 3 List of searching times for different networks after compression

*Time(s)*	*Size 3*	*Size 4*	*Size 5*	*Size 6*	*Size7*	*Size 8*	*N(edges) after compression*	*N(nodes) after compression*
*Networks*	*Size 3*	*Size 4*	*Size 5*	*Size 6*	*Size7*	*Size 8*	*N(edges) after compression*	*N(nodes) after compression*
Yeast	0.031	0.344	4.031				615	345
E coli	0.016	0.266	4.141				320	256
S208	0.001	0.002	0.031	0.125	0.579	2.953	189	122
S420	0.001	0.031	0.110	0.563	3.141	17.734	399	252
S838	0.063	0.110	0.500	2.843	17.204		819	512

The last two columns in this table contain the sizes of networks after reducing the parity nodes and the “repeated edges” connected with the parity nodes.

ISSN: 1756-0381