Fast grid layout algorithm for biological networks with sweep calculation

Kaname Kojima, Masao Nagasaki, Satoru Miyano

研究成果: Article査読

14 被引用数 (Scopus)


Motivation: Properly drawn biological networks are of great help in the comprehension of their characteristics. The quality of the layouts for retrieved biological networks is critical for pathway databases. However, since it is unrealistic to manually draw biological networks for every retrieval, automatic drawing algorithms are essential. Grid layout algorithms handle various biological properties such as aligning vertices having the same attributes and complicated positional constraints according to their subcellular localizations; thus, they succeed in providing biologically comprehensible layouts. However, existing grid layout algorithms are not suitable for real-time drawing, which is one of requisites for applications to pathway databases, due to their high-computational cost. In addition, they do not consider edge directions and their resulting layouts lack traceability for biochemical reactions and gene regulations, which are the most important features in biological networks. Results: We devise a new calculation method termed sweep calculation and reduce the time complexity of the current grid layout algorithms through its encoding and decoding processes. We conduct practical experiments by using 95 pathway models of various sizes from TRANSPATH and show that our new grid layout algorithm is much faster than existing grid layout algorithms. For the cost function, we introduce a new component that penalizes undesirable edge directions to avoid the lack of traceability in pathways due to the differences in direction between in-edges and out-edges of each vertex.

出版ステータスPublished - 2008 6月

ASJC Scopus subject areas

  • 統計学および確率
  • 生化学
  • 分子生物学
  • コンピュータ サイエンスの応用
  • 計算理論と計算数学
  • 計算数学


「Fast grid layout algorithm for biological networks with sweep calculation」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。