These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
144 related articles for article (PubMed ID: 23864855)
21. Accelerating network layouts using graph neural networks. Both C; Dehmamy N; Yu R; Barabási AL Nat Commun; 2023 Mar; 14(1):1560. PubMed ID: 36944640 [TBL] [Abstract][Full Text] [Related]
22. Survey on graph embeddings and their applications to machine learning problems on graphs. Makarov I; Kiselev D; Nikitinsky N; Subelj L PeerJ Comput Sci; 2021; 7():e357. PubMed ID: 33817007 [TBL] [Abstract][Full Text] [Related]
23. 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]
24. Ambiguity-free edge-bundling for interactive graph visualization. Luo SJ; Liu CL; Chen BY; Ma KL IEEE Trans Vis Comput Graph; 2012 May; 18(5):810-21. PubMed ID: 22442129 [TBL] [Abstract][Full Text] [Related]
26. An extended dual graph library and partitioning algorithm applicable to pseudoknotted RNA structures. Jain S; Saju S; Petingi L; Schlick T Methods; 2019 Jun; 162-163():74-84. PubMed ID: 30928508 [TBL] [Abstract][Full Text] [Related]
27. MetNetGE: interactive views of biological networks and ontologies. Jia M; Choi SY; Reiners D; Wurtele ES; Dickerson JA BMC Bioinformatics; 2010 Sep; 11():469. PubMed ID: 20849585 [TBL] [Abstract][Full Text] [Related]
28. 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]
29. Dynamic graph exploration by interactively linked node-link diagrams and matrix visualizations. Burch M; Ten Brinke KB; Castella A; Peters GKS; Shteriyanov V; Vlasvinkel R Vis Comput Ind Biomed Art; 2021 Sep; 4(1):23. PubMed ID: 34491465 [TBL] [Abstract][Full Text] [Related]
30. A new dynamical layout algorithm for complex biochemical reaction networks. Wegner K; Kummer U BMC Bioinformatics; 2005 Aug; 6():212. PubMed ID: 16124872 [TBL] [Abstract][Full Text] [Related]
31. Resolving the structure of interactomes with hierarchical agglomerative clustering. Park Y; Bader JS BMC Bioinformatics; 2011 Feb; 12 Suppl 1(Suppl 1):S44. PubMed ID: 21342576 [TBL] [Abstract][Full Text] [Related]
32. Evaluating the Readability of Force Directed Graph Layouts: A Deep Learning Approach. Haleem H; Wang Y; Puri A; Wadhwa S; Qu H IEEE Comput Graph Appl; 2019; 39(4):40-53. PubMed ID: 31226059 [TBL] [Abstract][Full Text] [Related]
33. Visual Analysis of Large Graphs Using (X,Y)-Clustering and Hybrid Visualizations. Batagelj V; Brandenburg FJ; Didimo W; Liotta G; Palladino P; Patrignani M IEEE Trans Vis Comput Graph; 2011 Nov; 17(11):1587-98. PubMed ID: 21173456 [TBL] [Abstract][Full Text] [Related]
34. ProteoLens: a visual analytic tool for multi-scale database-driven biological network data mining. Huan T; Sivachenko AY; Harrison SH; Chen JY BMC Bioinformatics; 2008 Aug; 9 Suppl 9(Suppl 9):S5. PubMed ID: 18793469 [TBL] [Abstract][Full Text] [Related]
35. 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]
36. 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]
37. iCAVE: an open source tool for visualizing biomolecular networks in 3D, stereoscopic 3D and immersive 3D. Liluashvili V; Kalayci S; Fluder E; Wilson M; Gabow A; Gümüs ZH Gigascience; 2017 Aug; 6(8):1-13. PubMed ID: 28814063 [TBL] [Abstract][Full Text] [Related]
38. 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]
39. 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]
40. Evaluation of clustering algorithms for protein-protein interaction networks. Brohée S; van Helden J BMC Bioinformatics; 2006 Nov; 7():488. PubMed ID: 17087821 [TBL] [Abstract][Full Text] [Related] [Previous] [Next] [New Search]