Graphia: A platform for the graph-based visualisation and analysis of high dimensional data

被引:30
|
作者
Freeman, Tom C. [1 ,2 ,4 ]
Horsewell, Sebastian [2 ]
Patir, Anirudh [1 ]
Harling-Lee, Josh [1 ]
Regan, Tim [1 ]
Shih, Barbara B. [1 ]
Prendergast, James [1 ]
Hume, David A. [3 ]
Angus, Tim [2 ,4 ]
机构
[1] Univ Edinburgh, Roslin Inst, Easter Bush Campus, Edinburgh, Midlothian, Scotland
[2] Univ Edinburgh, Roslin Innovat Ctr, Kajeka Ltd, Easter Bush Campus, Edinburgh, Midlothian, Scotland
[3] Univ Queensland, Translat Res Inst, Mater Res Inst, Woolloongabba, Qld, Australia
[4] Janssen Immunol, Spring House, PA 19477 USA
基金
英国生物技术与生命科学研究理事会;
关键词
NETWORKS;
D O I
10.1371/journal.pcbi.1010310
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Graphia is an open-source platform created for the graph-based analysis of the huge amounts of quantitative and qualitative data currently being generated from the study of genomes, genes, proteins metabolites and cells. Core to Graphia's functionality is support for the calculation of correlation matrices from any tabular matrix of continuous or discrete values, whereupon the software is designed to rapidly visualise the often very large graphs that result in 2D or 3D space. Following graph construction, an extensive range of measurement algorithms, routines for graph transformation, and options for the visualisation of node and edge attributes are available, for graph exploration and analysis. Combined, these provide a powerful solution for the interpretation of high-dimensional data from many sources, or data already in the form of a network or equivalent adjacency matrix. Several use cases of Graphia are described, to showcase its wide range of applications in the analysis biological data. Graphia runs on all major desktop operating systems, is extensible through the deployment of plugins and is freely available to download from https://graphia.app/.
引用
收藏
页数:17
相关论文
共 50 条
  • [1] A graph-based approach for the visualisation and analysis of bacterial pangenomes
    Joshua D. Harling-Lee
    Jamie Gorzynski
    Gonzalo Yebra
    Tim Angus
    J. Ross Fitzgerald
    Tom C. Freeman
    BMC Bioinformatics, 23
  • [2] A graph-based approach for the visualisation and analysis of bacterial pangenomes
    Harling-Lee, Joshua D.
    Gorzynski, Jamie
    Yebra, Gonzalo
    Angus, Tim
    Fitzgerald, J. Ross
    Freeman, Tom C.
    BMC BIOINFORMATICS, 2022, 23 (01)
  • [3] Uncertainty Quantification in Graph-Based Classification of High Dimensional Data
    Bertozzi, Andrea L.
    Luo, Xiyang
    Stuart, Andrew M.
    Zygalakis, Konstantinos C.
    SIAM-ASA JOURNAL ON UNCERTAINTY QUANTIFICATION, 2018, 6 (02): : 568 - 595
  • [4] Clustering high dimensional data: A graph-based relaxed optimization approach
    Lee, Chi-Hoon
    Zaiane, Osmar R.
    Park, Ho-Hyun
    Huang, Jiayuan
    Greiner, Russell
    INFORMATION SCIENCES, 2008, 178 (23) : 4501 - 4511
  • [5] Robust landmark graph-based clustering for high-dimensional data
    Yang, Ben
    Wu, Jinghan
    Sun, Aoran
    Gao, Naying
    Zhang, Xuetao
    NEUROCOMPUTING, 2022, 496 : 72 - 84
  • [6] Robust landmark graph-based clustering for high-dimensional data
    Yang, Ben
    Wu, Jinghan
    Sun, Aoran
    Gao, Naying
    Zhang, Xuetao
    Neurocomputing, 2022, 496 : 72 - 84
  • [7] Kernelized Graph-based Multi-view Clustering on High Dimensional Data
    Manna, Supratim
    Khonglah, Jessy Rimaya
    Mukherjee, Anirban
    Saha, Goutam
    2020 TWENTY SIXTH NATIONAL CONFERENCE ON COMMUNICATIONS (NCC 2020), 2020,
  • [8] High-dimensional data analysis and visualisation
    Chen, Cathy W. S.
    Lombardo, Rosaria
    Ripamonti, Enrico
    COMPUTATIONAL STATISTICS, 2024, 39 (01) : 1 - 2
  • [9] High-dimensional data analysis and visualisation
    Cathy W. S. Chen
    Rosaria Lombardo
    Enrico Ripamonti
    Computational Statistics, 2024, 39 : 1 - 2
  • [10] Graph-Based Analysis of Nuclear Smuggling Data
    Cook, Diane
    Holder, Lawrence
    Thompson, Sandy
    Whitney, Paul
    Chilton, Lawrence
    JOURNAL OF APPLIED SECURITY RESEARCH, 2009, 4 (04) : 501 - 517