A new grid- and modularity-based layout algorithm for complex biological networks

被引:4
|
作者
He, Sheng [1 ]
Liu, Yi-Jun [1 ]
Ye, Fei-Yue [1 ]
Li, Ren-Pu [1 ]
Dai, Ren-Jun [1 ]
机构
[1] Jiangsu Univ Technol, Sch Comp Engn, Changzhou, Peoples R China
来源
PLOS ONE | 2019年 / 14卷 / 08期
基金
中国国家自然科学基金;
关键词
CYTOSCAPE;
D O I
10.1371/journal.pone.0221620
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
The visualization of biological networks is critically important to aid researchers in understanding complex biological systems and arouses interest in designing efficient layout algorithms to draw biological networks according to their topology structures, especially for those networks with potential modules. The algorithms of grid layout series have an advantage in generating compact layouts with overlap-free nodes compared to force-directed; however, extant grid layout algorithms have difficulty in drawing modular networks and often generate layouts of high visual complexity when applied to networks with dense or clustered connectivity structure. To specifically assist the study of modular networks, we propose a grid-and modularity-based layout algorithm (GML) that consists of three stages: network preprocessing, module layout and grid optimization. The algorithm can draw complex biological networks with or without predefined modules based on the grid layout algorithm. It also outperforms other existing grid-based algorithms in the measurement of computation performance, ratio of edge-edge/node-edge crossings, relative edge lengths, and connectivity F-measures. GML helps users to gain insight into the network global characteristics through module layout, as well as to discern network details with grid optimization. GML has been developed as a VisANT plugin (https://hscz.github.io/Biological-Network-Visualization/) and is freely available to the research community.
引用
收藏
页数:17
相关论文
共 50 条
  • [41] A modularity-based improved small-world genetic algorithm for large-scale intercell scheduling with flexible routes
    Ning, Guangshuai
    Liu, Qiong
    Zou, Mengbang
    COMPUTERS & OPERATIONS RESEARCH, 2025, 177
  • [42] An efficient biological pathway layout algorithm combining grid-layout and spring embedder for complicated cellular location information
    Kaname Kojima
    Masao Nagasaki
    Satoru Miyano
    BMC Bioinformatics, 11 (1)
  • [43] An efficient biological pathway layout algorithm combining grid-layout and spring embedder for complicated cellular location information
    Kojima, Kaname
    Nagasaki, Masao
    Miyano, Satoru
    BMC BIOINFORMATICS, 2010, 11
  • [44] A new clustering algorithm based on data field in complex networks
    Liu, Yuhua
    Jin, Jianzhi
    Zhang, Yi
    Xu, Cui
    JOURNAL OF SUPERCOMPUTING, 2014, 67 (03): : 723 - 737
  • [45] A new clustering algorithm based on data field in complex networks
    Yuhua Liu
    Jianzhi Jin
    Yi Zhang
    Cui Xu
    The Journal of Supercomputing, 2014, 67 : 723 - 737
  • [46] A new immunization algorithm based on spectral properties for complex networks
    Zahedi, Ramin
    Khansari, Mohammad
    2015 7TH CONFERENCE ON INFORMATION AND KNOWLEDGE TECHNOLOGY (IKT), 2015,
  • [47] Relationship Recognition between Knowledge and Ability Based on the Modularity of Complex Networks
    Zou, Qingyu
    Sun, Xu
    Zhou, Zhenxiong
    SUSTAINABILITY, 2023, 15 (05)
  • [48] A Segmentation Algorithm based on Image Projection for Complex Text Layout
    Zhu, Wangsheng
    Chen, Qin
    Wei, Chuanyi
    Li, Ziyang
    2ND INTERNATIONAL CONFERENCE ON MATERIALS SCIENCE, RESOURCE AND ENVIRONMENTAL ENGINEERING (MSREE 2017), 2017, 1890
  • [49] Wind farm layout optimization based on grid-coordinate genetic algorithm
    Jiang Q.
    Zheng H.
    Yang Q.
    Zhou X.
    Huang G.
    Lin Y.
    Taiyangneng Xuebao/Acta Energiae Solaris Sinica, 2022, 43 (08): : 266 - 272
  • [50] A new component based algorithm for newspaper layout analysis
    Liu, F
    Luo, YP
    Yoshikawa, M
    Hu, DC
    SIXTH INTERNATIONAL CONFERENCE ON DOCUMENT ANALYSIS AND RECOGNITION, PROCEEDINGS, 2001, : 1176 - 1180