83 related articles for article (PubMed ID: 23559509)
1. CiSE: a circular spring embedder layout algorithm.
Dogrusoz U; Belviranli ME; Dilek A
IEEE Trans Vis Comput Graph; 2013 Jun; 19(6):953-66. PubMed ID: 23559509
[TBL] [Abstract][Full Text] [Related]
2. An efficient biological pathway layout algorithm combining grid-layout and spring embedder for complicated cellular location information.
Kojima K; Nagasaki M; Miyano S
BMC Bioinformatics; 2010 Jun; 11():335. PubMed ID: 20565884
[TBL] [Abstract][Full Text] [Related]
3. fCoSE: A Fast Compound Graph Layout Algorithm with Constraint Support.
Balci H; Dogrusoz U
IEEE Trans Vis Comput Graph; 2022 Dec; 28(12):4582-4593. PubMed ID: 34232882
[TBL] [Abstract][Full Text] [Related]
4. Automatic drawing of biological networks using cross cost and subcomponent data.
Kato M; Nagasaki M; Doi A; Miyano S
Genome Inform; 2005; 16(2):22-31. PubMed ID: 16901086
[TBL] [Abstract][Full Text] [Related]
5. An efficient grid layout algorithm for biological networks utilizing various biological attributes.
Kojima K; Nagasaki M; Jeong E; Kato M; Miyano S
BMC Bioinformatics; 2007 Mar; 8():76. PubMed ID: 17338825
[TBL] [Abstract][Full Text] [Related]
6. An algorithm for automated layout of process description maps drawn in SBGN.
Genc B; Dogrusoz U
Bioinformatics; 2016 Jan; 32(1):77-84. PubMed ID: 26363029
[TBL] [Abstract][Full Text] [Related]
7. Representing clusters using a maximum common edge substructure algorithm applied to reduced graphs and molecular graphs.
Gardiner EJ; Gillet VJ; Willett P; Cosgrove DA
J Chem Inf Model; 2007; 47(2):354-66. PubMed ID: 17309248
[TBL] [Abstract][Full Text] [Related]
8. Graph Drawing Aesthetics-Created by Users, Not Algorithms.
Purchase HC; Pilcher C; Plimmer B
IEEE Trans Vis Comput Graph; 2012 Jan; 18(1):81-92. PubMed ID: 21173454
[TBL] [Abstract][Full Text] [Related]
9. TreeNetViz: revealing patterns of networks over tree structures.
Gou L; Zhang XL
IEEE Trans Vis Comput Graph; 2011 Dec; 17(12):2449-58. PubMed ID: 22034366
[TBL] [Abstract][Full Text] [Related]
10. BFL: a node and edge betweenness based fast layout algorithm for large scale networks.
Hashimoto TB; Nagasaki M; Kojima K; Miyano S
BMC Bioinformatics; 2009 Jan; 10():19. PubMed ID: 19146673
[TBL] [Abstract][Full Text] [Related]
11. A neural-network algorithm for a graph layout problem.
Cimikowski A; Shope P
IEEE Trans Neural Netw; 1996; 7(2):341-5. PubMed ID: 18255588
[TBL] [Abstract][Full Text] [Related]
12. Visualization of graph products.
Jänicke S; Heine C; Hellmuth M; Stadler PF; Scheuermann G
IEEE Trans Vis Comput Graph; 2010; 16(6):1082-9. PubMed ID: 20975146
[TBL] [Abstract][Full Text] [Related]
13. Uncluttering graph layouts using anisotropic diffusion and mass transport.
Frishman Y; Tal A
IEEE Trans Vis Comput Graph; 2009; 15(5):777-88. PubMed ID: 19590104
[TBL] [Abstract][Full Text] [Related]
14. Visual exploration of complex time-varying graphs.
Kumar G; Garland M
IEEE Trans Vis Comput Graph; 2006; 12(5):805-12. PubMed ID: 17080803
[TBL] [Abstract][Full Text] [Related]
15. A grid layout algorithm for automatic drawing of biochemical networks.
Li W; Kurata H
Bioinformatics; 2005 May; 21(9):2036-42. PubMed ID: 15677705
[TBL] [Abstract][Full Text] [Related]
16. A maxent-stress model for graph layout.
Gansner ER; Hu Y; North S
IEEE Trans Vis Comput Graph; 2013 Jun; 19(6):927-40. PubMed ID: 23559507
[TBL] [Abstract][Full Text] [Related]
17. Exploration of networks using overview+detail with constraint-based cooperative layout.
Dwyer T; Marriott K; Schreiber F; Stuckey P; Woodward M; Wybrow M
IEEE Trans Vis Comput Graph; 2008; 14(6):1293-300. PubMed ID: 18988976
[TBL] [Abstract][Full Text] [Related]
18. Using the clustered circular layout as an informative method for visualizing protein-protein interaction networks.
Fung DC; Wilkins MR; Hart D; Hong SH
Proteomics; 2010 Jul; 10(14):2723-7. PubMed ID: 20480505
[TBL] [Abstract][Full Text] [Related]
19. IPSEP-COLA: an incremental procedure for separation constraint layout of graphs.
Dwyer T; Koren Y; Marriott K
IEEE Trans Vis Comput Graph; 2006; 12(5):821-8. PubMed ID: 17080805
[TBL] [Abstract][Full Text] [Related]
20. A new algorithm for comparing and visualizing relationships between hierarchical and flat gene expression data clusterings.
Torrente A; Kapushesky M; Brazma A
Bioinformatics; 2005 Nov; 21(21):3993-9. PubMed ID: 16141251
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
