Faculty of Computer and Information Science, University of Ljubljana, Slovenia.
BMC Bioinformatics. 2010 Sep 22;11:475. doi: 10.1186/1471-2105-11-475.
Researchers in systems biology use network visualization to summarize the results of their analysis. Such networks often include unconnected components, which popular network alignment algorithms place arbitrarily with respect to the rest of the network. This can lead to misinterpretations due to the proximity of otherwise unrelated elements.
We propose a new network layout optimization technique called FragViz which can incorporate additional information on relations between unconnected network components. It uses a two-step approach by first arranging the nodes within each of the components and then placing the components so that their proximity in the network corresponds to their relatedness. In the experimental study with the leukemia gene networks we demonstrate that FragViz can obtain network layouts which are more interpretable and hold additional information that could not be exposed using classical network layout optimization algorithms.
Network visualization relies on computational techniques for proper placement of objects under consideration. These algorithms need to be fast so that they can be incorporated in responsive interfaces required by the explorative data analysis environments. Our layout optimization technique FragViz meets these requirements and specifically addresses the visualization of fragmented networks, for which standard algorithms do not consider similarities between unconnected components. The experiments confirmed the claims on speed and accuracy of the proposed solution.
系统生物学的研究人员使用网络可视化来总结他们的分析结果。这样的网络通常包括未连接的组件,而流行的网络对齐算法会任意地将这些组件与网络的其余部分对齐。由于不相关元素的接近,这可能导致误解。
我们提出了一种新的网络布局优化技术,称为 FragViz,它可以整合关于未连接网络组件之间关系的附加信息。它采用两步法,首先在每个组件内排列节点,然后放置组件,使它们在网络中的接近度与它们的相关性相对应。在对白血病基因网络的实验研究中,我们证明 FragViz 可以获得更具可解释性的网络布局,并包含无法使用经典网络布局优化算法揭示的附加信息。
网络可视化依赖于计算技术来正确放置所考虑的对象。这些算法需要快速,以便可以将其集成到探索性数据分析环境所需的响应式界面中。我们的布局优化技术 FragViz 满足这些要求,并特别解决了碎片化网络的可视化问题,对于这些网络,标准算法不考虑未连接组件之间的相似性。实验证实了所提出解决方案的速度和准确性。