• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

二维空间中近似模式匹配在生化网络图网格布局中的应用。

Application of approximate pattern matching in two dimensional spaces to grid layout for biochemical network maps.

作者信息

Inoue Kentaro, Shimozono Shinichi, Yoshida Hideaki, Kurata Hiroyuki

机构信息

Department of Bioscience and Bioinformatics, Kyushu Institute of Technology, Iizuka, Fukuoka, Japan.

出版信息

PLoS One. 2012;7(6):e37739. doi: 10.1371/journal.pone.0037739. Epub 2012 Jun 5.

DOI:10.1371/journal.pone.0037739
PMID:22679486
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC3368000/
Abstract

BACKGROUND

For 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.

RESULTS

We 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.

CONCLUSIONS

Use 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.

摘要

背景

为了可视化大规模生化网络图谱,快速计算分子节点的坐标并增强对它们的理解或可追溯性非常重要。网格布局在绘制具有节点标签空间的紧凑、有序、平衡的网络图谱方面很有效,但现有的网格布局算法通常需要很高的计算成本,因为它们在整个优化过程中必须考虑复杂的位置约束。

结果

我们提出了一种混合网格布局算法,它由非网格快速布局(预处理程序)算法和将预处理后的节点分布在正方形网格点上的近似模式匹配算法组成。为了证明混合布局算法的可行性,从计算时间、边与边以及节点与边的交叉数、相对边长和F值等方面对其进行了表征。与其他现有的网格布局相比,该算法具有出色的性能。

结论

使用近似模式匹配算法可以通过快速的非网格算法将布局好的节点快速重新分布在正方形网格点上,同时保留节点之间的拓扑关系。该算法是模式匹配的一种新颖应用,从而为网格布局提供了突破。此应用程序可从http://www.cadlive.jp/hybridlayout/hybridlayout.html免费下载。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9d48/3368000/c21c8df9b2f3/pone.0037739.g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9d48/3368000/f1203e746967/pone.0037739.g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9d48/3368000/204a213ea67b/pone.0037739.g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9d48/3368000/b4c94b1a35ba/pone.0037739.g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9d48/3368000/fb99bf981b97/pone.0037739.g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9d48/3368000/c21c8df9b2f3/pone.0037739.g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9d48/3368000/f1203e746967/pone.0037739.g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9d48/3368000/204a213ea67b/pone.0037739.g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9d48/3368000/b4c94b1a35ba/pone.0037739.g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9d48/3368000/fb99bf981b97/pone.0037739.g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9d48/3368000/c21c8df9b2f3/pone.0037739.g005.jpg

相似文献

1
Application of approximate pattern matching in two dimensional spaces to grid layout for biochemical network maps.二维空间中近似模式匹配在生化网络图网格布局中的应用。
PLoS One. 2012;7(6):e37739. doi: 10.1371/journal.pone.0037739. Epub 2012 Jun 5.
2
A grid layout algorithm for automatic drawing of biochemical networks.一种用于自动绘制生化网络的网格布局算法。
Bioinformatics. 2005 May 1;21(9):2036-42. doi: 10.1093/bioinformatics/bti290. Epub 2005 Jan 27.
3
An efficient biological pathway layout algorithm combining grid-layout and spring embedder for complicated cellular location information.一种结合网格布局和弹簧嵌入的高效生物途径布局算法,用于复杂的细胞位置信息。
BMC Bioinformatics. 2010 Jun 18;11:335. doi: 10.1186/1471-2105-11-335.
4
A new grid- and modularity-based layout algorithm for complex biological networks.一种用于复杂生物网络的基于网格和模块性的新布局算法。
PLoS One. 2019 Aug 29;14(8):e0221620. doi: 10.1371/journal.pone.0221620. eCollection 2019.
5
Fast grid layout algorithm for biological networks with sweep calculation.基于扫描计算的生物网络快速网格布局算法
Bioinformatics. 2008 Jun 15;24(12):1433-41. doi: 10.1093/bioinformatics/btn196. Epub 2008 Apr 18.
6
An efficient grid layout algorithm for biological networks utilizing various biological attributes.一种利用各种生物学属性的生物网络高效网格布局算法。
BMC Bioinformatics. 2007 Mar 6;8:76. doi: 10.1186/1471-2105-8-76.
7
Automatic drawing of biological networks using cross cost and subcomponent data.利用交叉成本和子组件数据自动绘制生物网络。
Genome Inform. 2005;16(2):22-31.
8
BFL: a node and edge betweenness based fast layout algorithm for large scale networks.BFL:一种基于节点和边介数的大规模网络快速布局算法。
BMC Bioinformatics. 2009 Jan 15;10:19. doi: 10.1186/1471-2105-10-19.
9
A generic algorithm for layout of biological networks.一种用于生物网络布局的通用算法。
BMC Bioinformatics. 2009 Nov 12;10:375. doi: 10.1186/1471-2105-10-375.
10
A new dynamical layout algorithm for complex biochemical reaction networks.一种用于复杂生化反应网络的新动态布局算法。
BMC Bioinformatics. 2005 Aug 26;6:212. doi: 10.1186/1471-2105-6-212.

引用本文的文献

1
A new grid- and modularity-based layout algorithm for complex biological networks.一种用于复杂生物网络的基于网格和模块性的新布局算法。
PLoS One. 2019 Aug 29;14(8):e0221620. doi: 10.1371/journal.pone.0221620. eCollection 2019.
2
A parallel approximate string matching under Levenshtein distance on graphics processing units using warp-shuffle operations.一种在图形处理单元上使用 warp 混洗操作的基于莱文斯坦距离的并行近似字符串匹配。
PLoS One. 2017 Oct 10;12(10):e0186251. doi: 10.1371/journal.pone.0186251. eCollection 2017.
3
Structure and dynamics of molecular networks: a novel paradigm of drug discovery: a comprehensive review.

本文引用的文献

1
QAPgrid: a two level QAP-based approach for large-scale data analysis and visualization.QAPgrid:一种基于双层 QAP 的大规模数据分析和可视化方法。
PLoS One. 2011 Jan 18;6(1):e14468. doi: 10.1371/journal.pone.0014468.
2
An efficient biological pathway layout algorithm combining grid-layout and spring embedder for complicated cellular location information.一种结合网格布局和弹簧嵌入的高效生物途径布局算法,用于复杂的细胞位置信息。
BMC Bioinformatics. 2010 Jun 18;11:335. doi: 10.1186/1471-2105-11-335.
3
Visualization of omics data for systems biology.
分子网络的结构与动态:药物发现的新范例:全面综述。
Pharmacol Ther. 2013 Jun;138(3):333-408. doi: 10.1016/j.pharmthera.2013.01.016. Epub 2013 Feb 4.
系统生物学中组学数据的可视化。
Nat Methods. 2010 Mar;7(3 Suppl):S56-68. doi: 10.1038/nmeth.1436.
4
LucidDraw: efficiently visualizing complex biochemical networks within MATLAB.LucidDraw:在 MATLAB 中高效可视化复杂生化网络。
BMC Bioinformatics. 2010 Jan 15;11:31. doi: 10.1186/1471-2105-11-31.
5
A generic algorithm for layout of biological networks.一种用于生物网络布局的通用算法。
BMC Bioinformatics. 2009 Nov 12;10:375. doi: 10.1186/1471-2105-10-375.
6
NAViGaTOR: Network Analysis, Visualization and Graphing Toronto.NAViGaTOR:多伦多的网络分析、可视化和绘图。
Bioinformatics. 2009 Dec 15;25(24):3327-9. doi: 10.1093/bioinformatics/btp595. Epub 2009 Oct 16.
7
Cerebral: visualizing multiple experimental conditions on a graph with biological context.大脑:在具有生物学背景的图表上可视化多种实验条件。
IEEE Trans Vis Comput Graph. 2008 Nov-Dec;14(6):1253-60. doi: 10.1109/TVCG.2008.117.
8
Visualizing global properties of large complex networks.可视化大型复杂网络的全局属性。
PLoS One. 2008 Jul 2;3(7):e2541. doi: 10.1371/journal.pone.0002541.
9
Fast grid layout algorithm for biological networks with sweep calculation.基于扫描计算的生物网络快速网格布局算法
Bioinformatics. 2008 Jun 15;24(12):1433-41. doi: 10.1093/bioinformatics/btn196. Epub 2008 Apr 18.
10
Extended CADLIVE: a novel graphical notation for design of biochemical network maps and computational pathway analysis.扩展CADLIVE:一种用于生化网络图谱设计和计算通路分析的新型图形表示法。
Nucleic Acids Res. 2007;35(20):e134. doi: 10.1093/nar/gkm769. Epub 2007 Oct 16.