메뉴 건너뛰기




Volumn 10, Issue , 2009, Pages

BFL: A node and edge betweenness based fast layout algorithm for large scale networks

Author keywords

[No Author keywords available]

Indexed keywords

BIOLOGICAL PHENOMENA; FAST PARALLEL ALGORITHMS; GRAPH LAYOUT ALGORITHMS; NETWORK VISUALIZATION; OPTIMIZATION ALGORITHMS; SEQUENTIAL INSERTION; SUB-OPTIMAL POSITIONS; SUBCELLULAR LOCALIZATIONS;

EID: 65349165145     PISSN: None     EISSN: 14712105     Source Type: Journal    
DOI: 10.1186/1471-2105-10-19     Document Type: Article
Times cited : (13)

References (35)
  • 3
    • 0035003178 scopus 로고    scopus 로고
    • A graph layout algorithm for drawing metabolic pathways
    • 10.1093/bioinformatics/17.5.461 11331241
    • Becker MY Rojas I A graph layout algorithm for drawing metabolic pathways Bioinformatics 2001, 17(5):461-467. 10.1093/bioinformatics/ 17.5.461 11331241
    • (2001) Bioinformatics , vol.17 , Issue.5 , pp. 461-467
    • Becker, M.Y.1    Rojas, I.2
  • 4
    • 0019530043 scopus 로고
    • Methods for visual understanding of hierarchical system structures
    • 10.1109/TSMC.1981.4308636
    • Sugiyama K Tagawa S Toda M Methods for visual understanding of hierarchical system structures IEEE Transactions on Systems, Man and Cybernetics 1981, 11:109-125. 10.1109/TSMC.1981.4308636
    • (1981) IEEE Transactions on Systems, Man and Cybernetics , vol.11 , pp. 109-125
    • Sugiyama, K.1    Tagawa, S.2    Toda, M.3
  • 6
    • 0001070640 scopus 로고
    • A heuristic for graph drawing
    • Eades P A heuristic for graph drawing Congressus Numerantium 1984, 42:149-160.
    • (1984) Congressus Numerantium , vol.42 , pp. 149-160
    • Eades, P.1
  • 8
    • 84905389375 scopus 로고    scopus 로고
    • A constrained, force-directed layout algorithm for biological pathways
    • Genc B Dogrusoz U A constrained, force-directed layout algorithm for biological pathways Graph Drawing 2003 2003, 314-319.
    • (2003) Graph Drawing 2003 , pp. 314-319
    • Genc, B.1    Dogrusoz, U.2
  • 9
    • 18744387729 scopus 로고    scopus 로고
    • A grid layout algorithm for automatic drawing of biochemical networks
    • 10.1093/bioinformatics/bti290 15677705
    • Li W Kurata H A grid layout algorithm for automatic drawing of biochemical networks Bioinformatics 2005, 21(9):2036-2042. 10.1093/ bioinformatics/bti290 15677705
    • (2005) Bioinformatics , vol.21 , Issue.9 , pp. 2036-2042
    • Li, W.1    Kurata, H.2
  • 10
    • 33947388382 scopus 로고    scopus 로고
    • An efficient grid layout algorithm for biological networks utilizing various biological attributes
    • 1821340 17338825
    • Kojima K Nagasaki M Euna J Miyano S An efficient grid layout algorithm for biological networks utilizing various biological attributes BMC Bioinformatics 2007, 8:76. 1821340 17338825
    • (2007) BMC Bioinformatics , vol.8 , pp. 76
    • Kojima, K.1    Nagasaki, M.2    Euna, J.3    Miyano, S.4
  • 11
    • 33845357608 scopus 로고    scopus 로고
    • An Algorithm for Modularity Analysis of Directed and Weighted Biological Networks Based on Edge-Betweenness Centrality
    • 10.1093/bioinformatics/btl533 17060356
    • Yoon J Blumer A Lee K An Algorithm for Modularity Analysis of Directed and Weighted Biological Networks Based on Edge-Betweenness Centrality Bioinformatics 2006, 22:3106-3108. 10.1093/bioinformatics/btl533 17060356
    • (2006) Bioinformatics , vol.22 , pp. 3106-3108
    • Yoon, J.1    Blumer, A.2    Lee, K.3
  • 13
    • 45449113970 scopus 로고    scopus 로고
    • Fast grid layout algorithm for biological networks with sweep calculation
    • 10.1093/bioinformatics/btn196 18424458
    • Kojima K Nagasaki M Miyano S Fast grid layout algorithm for biological networks with sweep calculation Bioinformatics 2008, 24:1433-41. 10.1093/ bioinformatics/btn196 18424458
    • (2008) Bioinformatics , vol.24 , pp. 1433-1441
    • Kojima, K.1    Nagasaki, M.2    Miyano, S.3
  • 14
    • 0001492480 scopus 로고
    • Centrality in valued graphs: A measure of betweenness based on network flow
    • 10.1016/0378-8733(91)90017-N
    • Freeman LC Borgatti SP White DR Centrality in valued graphs: A measure of betweenness based on network flow Social Networks 1991, 13:141-154. 10.1016/0378-8733(91)90017-N
    • (1991) Social Networks , vol.13 , pp. 141-154
    • Freeman, L.C.1    Borgatti, S.P.2    White, D.R.3
  • 15
    • 0037062448 scopus 로고    scopus 로고
    • Community structure in social and biological networks
    • 122977 12060727 10.1073/pnas.122653799
    • Girvan M Newman MEJ Community structure in social and biological networks PNAS 2002, 99:7821-7826. 122977 12060727 10.1073/pnas.122653799
    • (2002) PNAS , vol.99 , pp. 7821-7826
    • Girvan, M.1    Newman, M.E.J.2
  • 16
    • 25444490121 scopus 로고    scopus 로고
    • The Use of Edge-Betweenness Clustering to Investigate Biological Function in Protein Interaction Networks
    • 555937 10.1186/1471-2105-6-39
    • Dunn R Dudbridge F Sanderson CM The Use of Edge-Betweenness Clustering to Investigate Biological Function in Protein Interaction Networks BMC Bioinformatics 2005, 6:39. 555937 15740614 10.1186/1471-2105-6-39
    • (2005) BMC Bioinformatics , vol.6 , pp. 39
    • Dunn, R.1    Dudbridge, F.2    Sanderson, C.M.3
  • 17
    • 0035648637 scopus 로고    scopus 로고
    • A Faster Algorithm for Betweenness Centrality
    • Brandes U A Faster Algorithm for Betweenness Centrality Journal of Mathematical Soctology 2001, 25:163-177.
    • (2001) Journal of Mathematical Soctology , vol.25 , pp. 163-177
    • Brandes, U.1
  • 19
    • 85027125892 scopus 로고    scopus 로고
    • Comparison of Centrality for Biological Networks
    • Bioinformatics Center Gatersleben-Halle Stoye GJ
    • Koschutzki D Schreiber F Comparison of Centrality for Biological Networks Proceedings German conference for bioinformatics Bioinformatics Center Gatersleben-Halle Stoye GJ 2004, 199-206.
    • (2004) Proceedings German Conference for Bioinformatics , pp. 199-206
    • Koschutzki, D.1    Schreiber, F.2
  • 20
    • 0035799707 scopus 로고    scopus 로고
    • Lethality and Centrality in Protein Networks
    • 10.1038/35075138
    • Jeong H Mason SP Barabasi AL Oltvai ZN Lethality and Centrality in Protein Networks Nature 2001, 411:41-42. 10.1038/35075138 11333967
    • (2001) Nature , vol.411 , pp. 41-42
    • Jeong, H.1    Mason, S.P.2    Barabasi, A.L.3    Oltvai, Z.N.4
  • 21
    • 33846681448 scopus 로고    scopus 로고
    • Modular organization of protein interaction networks
    • 10.1093/bioinformatics/btl562
    • Luo F Yang Y Chen CF Change R Zhou J Modular organization of protein interaction networks Bioinformatics 2002, 23:207-214. 10.1093/ bioinformatics/btl562
    • (2002) Bioinformatics , vol.23 , pp. 207-214
    • Luo, F.1    Yang, Y.2    Chen, C.F.3    Change, R.4    Zhou, J.5
  • 22
    • 0030264246 scopus 로고    scopus 로고
    • Drawing Graphs Nicely Using Simulated Annealing
    • 10.1145/234535.234538
    • Davidson R Harel D Drawing Graphs Nicely Using Simulated Annealing ACM Transactions on Graphics 1996, 15:301-331. 10.1145/234535.234538
    • (1996) ACM Transactions on Graphics , vol.15 , pp. 301-331
    • Davidson, R.1    Harel, D.2
  • 23
    • 0021644214 scopus 로고
    • The Quadtree and Related Heiarchical Data Structures
    • 10.1145/356924.356930
    • Samet H The Quadtree and Related Heiarchical Data Structures ACM Computing Surveys 1984, 16:187-260. 10.1145/356924.356930
    • (1984) ACM Computing Surveys , vol.16 , pp. 187-260
    • Samet, H.1
  • 27
    • 33845444174 scopus 로고    scopus 로고
    • A complex oscillating network of signaling genes underlies the mouse segmentation clock
    • 10.1126/science.1133141 17095659
    • Deque'ant ML Glynn E Gaudenz K Wahl M Chen J Mushegian A Pourquie' O A complex oscillating network of signaling genes underlies the mouse segmentation clock Science 2006, 314:1595-1598. 10.1126/science.1133141 17095659
    • (2006) Science , vol.314 , pp. 1595-1598
    • Deque'ant, M.L.1    Glynn, E.2    Gaudenz, K.3    Wahl, M.4    Chen, J.5    Mushegian, A.6    Pourquie', O.7
  • 28
    • 0036013593 scopus 로고    scopus 로고
    • Statistical mechanics of complex networks
    • 10.1103/RevModPhys.74.47
    • Albert R Barabasi AL Statistical mechanics of complex networks Reviews of Modern Physics 2002, 74:47-97. 10.1103/RevModPhys.74.47
    • (2002) Reviews of Modern Physics , vol.74 , pp. 47-97
    • Albert, R.1    Barabasi, A.L.2
  • 29
    • 0024640140 scopus 로고
    • An algorithm for drawing general undirected graphs
    • 10.1016/0020-0190(89)90102-6
    • Kamada T Kawai S An algorithm for drawing general undirected graphs Information Processing Letters 1989, 31:7-15. 10.1016/ 0020-0190(89)90102-6
    • (1989) Information Processing Letters , vol.31 , pp. 7-15
    • Kamada, T.1    Kawai, S.2
  • 31
    • 0002226683 scopus 로고    scopus 로고
    • Pajek - Program for large network analysis
    • Batagelj V Mrvar A Pajek - program for large network analysis Connections 1998, 21:47-57.
    • (1998) Connections , vol.21 , pp. 47-57
    • Batagelj, V.1    Mrvar, A.2
  • 33
    • 0142148182 scopus 로고    scopus 로고
    • A fast layout algorithm for protein interaction networks
    • 10.1093/bioinformatics/btg346 14555620
    • Han K Ju B A fast layout algorithm for protein interaction networks Bioinformatics 2003, 19:1882-1888. 10.1093/bioinformatics/btg346 14555620
    • (2003) Bioinformatics , vol.19 , pp. 1882-1888
    • Han, K.1    Ju, B.2
  • 34
    • 2642533799 scopus 로고    scopus 로고
    • Genomic Object Net: I. A platform for modeling and simulating biopathways
    • 15130806
    • Nagasaki M Doi A Matsuno H Miyano S Genomic Object Net: I. A platform for modeling and simulating biopathways Applied Bioinformatics 2003, 2:181-184. 15130806
    • (2003) Applied Bioinformatics , vol.2 , pp. 181-184
    • Nagasaki, M.1    Doi, A.2    Matsuno, H.3    Miyano, S.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.