Skip to main content
Figure 11 | BMC Bioinformatics

Figure 11

From: An efficient biological pathway layout algorithm combining grid-layout and spring embedder for complicated cellular location information

Figure 11

Comparisons of total cost (left), number of edge-edge crossings (middle left), number of node-edge crossings (middle right), and running time (right) for cell fate simulation model of C. elegans. Total costs, Numbers of edge-edge intersections and node-edge intersections and running time for Grid Layout and GDC (Grid Layout with dynamic compartment update) are compared using box plots. These indicators are obtained by applying these two algorithms to ten randomly obtained layouts of the cell fate simulation model C. elegans.

Back to article page