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.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

136 related articles for article (PubMed ID: 30575538)

  • 21. Online dynamic graph drawing.
    Frishman Y; Tal A
    IEEE Trans Vis Comput Graph; 2008; 14(4):727-40. PubMed ID: 18467750
    [TBL] [Abstract][Full Text] [Related]  

  • 22. 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]  

  • 23. Multi-level graph layout on the GPU.
    Frishman Y; Tal A
    IEEE Trans Vis Comput Graph; 2007; 13(6):1310-9. PubMed ID: 17968079
    [TBL] [Abstract][Full Text] [Related]  

  • 24. 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]  

  • 25. Numerical integration methods and layout improvements in the context of dynamic RNA visualization.
    Shabash B; Wiese KC
    BMC Bioinformatics; 2017 May; 18(1):282. PubMed ID: 28558664
    [TBL] [Abstract][Full Text] [Related]  

  • 26. EClerize: A customized force-directed graph drawing algorithm for biological graphs with EC attributes.
    Danaci HF; Cetin-Atalay R; Atalay V
    J Bioinform Comput Biol; 2018 Aug; 16(4):1850007. PubMed ID: 29783871
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Intelligent Graph Layout Using Many Users' Input.
    Yuan X; Che L; Hu Y; Zhang X
    IEEE Trans Vis Comput Graph; 2012 Dec; 18(12):2699-708. PubMed ID: 26357179
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Toward Efficient Deep Learning for Graph Drawing (DL4GD).
    Giovannangeli L; Lalanne F; Auber D; Giot R; Bourqui R
    IEEE Trans Vis Comput Graph; 2024 Feb; 30(2):1516-1532. PubMed ID: 36378788
    [TBL] [Abstract][Full Text] [Related]  

  • 29. A new graph drawing scheme for social network.
    Wang EK; Zou F
    ScientificWorldJournal; 2014; 2014():930314. PubMed ID: 25157378
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Taurus: Towards a Unified Force Representation and Universal Solver for Graph Layout.
    Xue M; Wang Z; Zhong F; Wang Y; Xu M; Deussen O; Wang Y
    IEEE Trans Vis Comput Graph; 2023 Jan; 29(1):886-895. PubMed ID: 36166546
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Drawing Large Graphs by Multilevel Maxent-Stress Optimization.
    Meyerhenke H; Nollenburg M; Schulz C
    IEEE Trans Vis Comput Graph; 2018 May; 24(5):1814-1827. PubMed ID: 28368821
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Drawing directed graphs using quadratic programming.
    Dwyer T; Koren Y; Marriott K
    IEEE Trans Vis Comput Graph; 2006; 12(4):536-48. PubMed ID: 16805262
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Combining hierarchy and energy for drawing directed graphs.
    Carmel L; Harel D; Koren Y
    IEEE Trans Vis Comput Graph; 2004; 10(1):46-57. PubMed ID: 15382697
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Revisiting Viewing Graph Solvability: an Effective Approach Based on Cycle Consistency.
    Arrigoni F; Fusiello A; Rizzi R; Ricci E; Pajdla T
    IEEE Trans Pattern Anal Mach Intell; 2022 Oct; PP():. PubMed ID: 36215371
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Animation, Small Multiples, and the Effect of Mental Map Preservation in Dynamic Graphs.
    Archambault D; Purchase H; Pinaud B
    IEEE Trans Vis Comput Graph; 2011 Apr; 17(4):539-52. PubMed ID: 20498503
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Algorithm for the Pruning of Synthesis Graphs.
    Zahoránszky-Kőhalmi G; Lysov N; Vorontcov I; Wang J; Soundararajan J; Metaxotos D; Mathew B; Sarosh R; Michael SG; Godfrey AG
    J Chem Inf Model; 2022 May; 62(9):2226-2238. PubMed ID: 35438992
    [TBL] [Abstract][Full Text] [Related]  

  • 37. DEMA: a distance-bounded energy-field minimization algorithm to model and layout biomolecular networks with quantitative features.
    Weng Z; Yue Z; Zhu Y; Chen JY
    Bioinformatics; 2022 Jun; 38(Suppl 1):i359-i368. PubMed ID: 35758816
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Fast construction of assembly trees for molecular graphs.
    Artemova S; Grudinin S; Redon S
    J Comput Chem; 2011 Jun; 32(8):1589-98. PubMed ID: 21328401
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Tugging graphs faster: efficiently modifying path-preserving hierarchies for browsing paths.
    Archambault D; Munzner T; Auber D
    IEEE Trans Vis Comput Graph; 2011 Mar; 17(3):276-89. PubMed ID: 20421680
    [TBL] [Abstract][Full Text] [Related]  

  • 40. Live-wires using path-graphs.
    König S; Hesser J
    Methods Inf Med; 2004; 43(4):371-5. PubMed ID: 15472749
    [TBL] [Abstract][Full Text] [Related]  

    [Previous]   [Next]    [New Search]
    of 7.