首页 | 本学科首页   官方微博 | 高级检索  
   检索      


BFL: a node and edge betweenness based fast layout algorithm for large scale networks
Authors:Tatsunori B Hashimoto  Masao Nagasaki  Kaname Kojima and Satoru Miyano
Institution:(1) Harvard College, Adams House, Cambridge, Massachusetts MA 02138, USA;(2) Human Genome Center, Institute of Medical Science, University of Tokyo, 4-6-1 Shirokanedai, Minato-ku Tokyo, 108-8639, Japan
Abstract:

Background  

Network visualization would serve as a useful first step for analysis. However, current graph layout algorithms for biological pathways are insensitive to biologically important information, e.g. subcellular localization, biological node and graph attributes, or/and not available for large scale networks, e.g. more than 10000 elements.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号