摘要 |
Disclosed is a method for partitioned layout of protein interaction networks into a three-dimensional graph, comprising the steps of grouping nodes into group 1, group 2 and group 3 based on their interaction properties; computing shortest paths between nodes of each group, between nodes of the group 1 and nodes of the group 2, between nodes of the group 1 and nodes of the group 3, and between nodes of the group 2 and nodes of the group 3; and layout drawing by positioning nodes of the group 3 in the center of a sphere, nodes of the group 2 in the outer region of the group 3, and nodes of the group 1 in the outer region of the groups 2 and 3, by spring-force layout algorithm. The present invention is advantageous in terms of a clear and aesthetically pleasing drawing and being much faster than other forced-directed layouts. |