Name
Title | ||
|---|---|---|
An efficient biological pathway layout algorithm combining grid-layout and spring embedder for complicated cellular location information. |
Abstract | ||
|---|---|---|
Graph drawing is one of the important techniques for understanding biological regulations in a cell or among cells at the pathway level. Among many available layout algorithms, the spring embedder algorithm is widely used not only for pathway drawing but also for circuit placement and www visualization and so on because of the harmonized appearance of its results. For pathway drawing, location information is essential for its comprehension. However, complex shapes need to be taken into account when torus-shaped location information such as nuclear inner membrane, nuclear outer membrane, and plasma membrane is considered. Unfortunately, the spring embedder algorithm cannot easily handle such information. In addition, crossings between edges and nodes are usually not considered explicitly.We proposed a new grid-layout algorithm based on the spring embedder algorithm that can handle location information and provide layouts with harmonized appearance. In grid-layout algorithms, the mapping of nodes to grid points that minimizes a cost function is searched. By imposing positional constraints on grid points, location information including complex shapes can be easily considered. Our layout algorithm includes the spring embedder cost as a component of the cost function. We further extend the layout algorithm to enable dynamic update of the positions and sizes of compartments at each step.The new spring embedder-based grid-layout algorithm and a spring embedder algorithm are applied to three biological pathways; endothelial cell model, Fas-induced apoptosis model, and C. elegans cell fate simulation model. From the positional constraints, all the results of our algorithm satisfy location information, and hence, more comprehensible layouts are obtained as compared to the spring embedder algorithm. From the comparison of the number of crossings, the results of the grid-layout-based algorithm tend to contain more crossings than those of the spring embedder algorithm due to the positional constraints. For a fair comparison, we also apply our proposed method without positional constraints. This comparison shows that these results contain less crossings than those of the spring embedder algorithm. We also compared layouts of the proposed algorithm with and without compartment update and verified that latter can reach better local optima. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1186/1471-2105-11-335 | BMC Bioinformatics |
Keywords | Field | DocType |
apoptosis,point location,simulation model,cell fate,endothelial cell,cost function,satisfiability,outer membrane,computational biology,inner membrane,bioinformatics,algorithms,graph drawing,microarrays | Graph drawing,Visualization,Computer science,Euclidean distance,Algorithm,Bioinformatics,Genetics,Grid | Journal |
Volume | Issue | ISSN |
11 | 1 | 1471-2105 |
Citations | PageRank | References |
11 | 0.40 | 19 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kaname Kojima | 1 | 152 | 11.12 |
| Masao Nagasaki | 2 | 368 | 26.22 |
| Satoru Miyano | 3 | 2406 | 250.71 |