BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

141 related articles for article (PubMed ID: 33275582)

  • 1. DRGraph: An Efficient Graph Layout Algorithm for Large-scale Graphs by Dimensionality Reduction.
    Zhu M; Chen W; Hu Y; Hou Y; Liu L; Zhang K
    IEEE Trans Vis Comput Graph; 2021 Feb; 27(2):1666-1676. PubMed ID: 33275582
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

  • 6. Transduction on Directed Graphs via Absorbing Random Walks.
    De J; Zhang X; Lin F; Cheng L; De J; Xiaowei Zhang ; Feng Lin ; Li Cheng ; De J; Cheng L; Zhang X; Lin F
    IEEE Trans Pattern Anal Mach Intell; 2018 Jul; 40(7):1770-1784. PubMed ID: 28809671
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Graph drawing using Jaya.
    Dib FK; Rodgers P
    PLoS One; 2023; 18(6):e0287744. PubMed ID: 37368896
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Graph drawing using tabu search coupled with path relinking.
    Dib FK; Rodgers P
    PLoS One; 2018; 13(5):e0197103. PubMed ID: 29746576
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 12. Joint Graph Layouts for Visualizing Collections of Segmented Meshes.
    Ren J; Schneider J; Ovsjanikov M; Wonka P
    IEEE Trans Vis Comput Graph; 2018 Sep; 24(9):2546-2558. PubMed ID: 28920901
    [TBL] [Abstract][Full Text] [Related]  

  • 13. The storage capacity of a directed graph and nodewise autonomous, ubiquitous learning.
    Wei H; Li F
    Front Comput Neurosci; 2023; 17():1254355. PubMed ID: 37927548
    [TBL] [Abstract][Full Text] [Related]  

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

  • 15. Event-Based Dynamic Graph Visualisation.
    Simonetto P; Archambault D; Kobourov S
    IEEE Trans Vis Comput Graph; 2020 Jul; 26(7):2373-2386. PubMed ID: 30575538
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 18. High-Quality Ultra-Compact Grid Layout of Grouped Networks.
    Yoghourdjian V; Dwyer T; Gange G; Kieffer S; Klein K; Marriott K
    IEEE Trans Vis Comput Graph; 2016 Jan; 22(1):339-48. PubMed ID: 26390477
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Approximate Graph Edit Distance in Quadratic Time.
    Riesen K; Ferrer M; Bunke H
    IEEE/ACM Trans Comput Biol Bioinform; 2020; 17(2):483-494. PubMed ID: 26390496
    [TBL] [Abstract][Full Text] [Related]  

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

    [Next]    [New Search]
    of 8.