WEKO3
アイテム
Application of Approximate Pattern Matching in Two Dimensional Spaces to Grid Layout for Biochemical Network Maps
http://hdl.handle.net/10228/5571
http://hdl.handle.net/10228/5571e7dd0578-e3f4-4e80-bff9-80ba0a2713c1
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
journal.pone.0037739.pdf (914.0 kB)
|
|
| アイテムタイプ | 学術雑誌論文 = Journal Article(1) | |||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2016-02-03 | |||||||||||||||||||||
| 資源タイプ | ||||||||||||||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||||||||||||||
| 資源タイプ | journal article | |||||||||||||||||||||
| タイトル | ||||||||||||||||||||||
| タイトル | Application of Approximate Pattern Matching in Two Dimensional Spaces to Grid Layout for Biochemical Network Maps | |||||||||||||||||||||
| 言語 | en | |||||||||||||||||||||
| 言語 | ||||||||||||||||||||||
| 言語 | eng | |||||||||||||||||||||
| 著者 |
Inoue, Kentaro
× Inoue, Kentaro× 下薗, 真一
WEKO
15794
× Yoshida, Hideaki× 倉田, 博之
WEKO
2130
|
|||||||||||||||||||||
| 抄録 | ||||||||||||||||||||||
| 内容記述タイプ | Abstract | |||||||||||||||||||||
| 内容記述 | BackgroundFor visualizing large-scale biochemical network maps, it is important to calculate the coordinates of molecular nodes quickly and to enhance the understanding or traceability of them. The grid layout is effective in drawing compact, orderly, balanced network maps with node label spaces, but existing grid layout algorithms often require a high computational cost because they have to consider complicated positional constraints through the entire optimization process.ResultsWe propose a hybrid grid layout algorithm that consists of a non-grid, fast layout (preprocessor) algorithm and an approximate pattern matching algorithm that distributes the resultant preprocessed nodes on square grid points. To demonstrate the feasibility of the hybrid layout algorithm, it is characterized in terms of the calculation time, numbers of edge-edge and node-edge crossings, relative edge lengths, and F-measures. The proposed algorithm achieves outstanding performances compared with other existing grid layouts.ConclusionsUse of an approximate pattern matching algorithm quickly redistributes the laid-out nodes by fast, non-grid algorithms on the square grid points, while preserving the topological relationships among the nodes. The proposed algorithm is a novel use of the pattern matching, thereby providing a breakthrough for grid layout. This application program can be freely downloaded from http://www.cadlive.jp/hybridlayout/hybridlayout.html. | |||||||||||||||||||||
| 言語 | en | |||||||||||||||||||||
| 書誌情報 |
en : PLoS ONE 巻 7, 号 6, p. e37739, 発行日 2012-06-05 |
|||||||||||||||||||||
| 出版社 | ||||||||||||||||||||||
| 出版者 | Public Library of Science | |||||||||||||||||||||
| 言語 | en | |||||||||||||||||||||
| DOI | ||||||||||||||||||||||
| 関連タイプ | isIdenticalTo | |||||||||||||||||||||
| 識別子タイプ | DOI | |||||||||||||||||||||
| 関連識別子 | https://doi.org/10.1371/journal.pone.0037739 | |||||||||||||||||||||
| ISSN | ||||||||||||||||||||||
| 収録物識別子タイプ | EISSN | |||||||||||||||||||||
| 収録物識別子 | 1932-6203 | |||||||||||||||||||||
| 著作権関連情報 | ||||||||||||||||||||||
| 権利情報 | Copyright (c) 2012 Inoue et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. | |||||||||||||||||||||
| 出版タイプ | ||||||||||||||||||||||
| 出版タイプ | VoR | |||||||||||||||||||||
| 出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||||||||||||||||||
| 査読の有無 | ||||||||||||||||||||||
| 値 | yes | |||||||||||||||||||||
| 研究者情報 | ||||||||||||||||||||||
| URL | https://hyokadb02.jimu.kyutech.ac.jp/html/265_ja.html | |||||||||||||||||||||
| 連携ID | ||||||||||||||||||||||
| 値 | 5314 | |||||||||||||||||||||
