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 *

114 related articles for article (PubMed ID: 37159326)

  • 1. A Scalable Method for Readable Tree Layouts.
    Gray K; Li M; Ahmed R; Rahman MK; Azad A; Kobourov S; Borner K
    IEEE Trans Vis Comput Graph; 2024 Feb; 30(2):1564-1578. PubMed ID: 37159326
    [TBL] [Abstract][Full Text] [Related]  

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

  • 3. Application of approximate pattern matching in two dimensional spaces to grid layout for biochemical network maps.
    Inoue K; Shimozono S; Yoshida H; Kurata H
    PLoS One; 2012; 7(6):e37739. PubMed ID: 22679486
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Graph Exploration With Embedding-Guided Layouts.
    Shen L; Tai Z; Shen E; Wang J
    IEEE Trans Vis Comput Graph; 2024 Jul; 30(7):3693-3708. PubMed ID: 37022062
    [TBL] [Abstract][Full Text] [Related]  

  • 5. A new grid- and modularity-based layout algorithm for complex biological networks.
    He S; Liu YJ; Ye FY; Li RP; Dai RJ
    PLoS One; 2019; 14(8):e0221620. PubMed ID: 31465473
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 8. A multilevel gamma-clustering layout algorithm for visualization of biological networks.
    Hruz T; Wyss M; Lucas C; Laule O; von Rohr P; Zimmermann P; Bleuler S
    Adv Bioinformatics; 2013; 2013():920325. PubMed ID: 23864855
    [TBL] [Abstract][Full Text] [Related]  

  • 9. The Sprawlter Graph Readability Metric: Combining Sprawl and Area-Aware Clutter.
    Liu Z; Itoh T; Dawson JQ; Munzner T
    IEEE Trans Vis Comput Graph; 2020 Jun; 26(6):2180-2191. PubMed ID: 32012018
    [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. Multicriteria Scalable Graph Drawing via Stochastic Gradient Descent, (SGD)
    Ahmed R; De Luca F; Devkota S; Kobourov S; Li M
    IEEE Trans Vis Comput Graph; 2022 Jun; 28(6):2388-2399. PubMed ID: 35230951
    [TBL] [Abstract][Full Text] [Related]  

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

  • 13. Overlap Removal by Stochastic Gradient Descent With(out) Shape Awareness.
    Giovannangeli L; Lalanne F; Giot R; Bourqui R
    IEEE Trans Vis Comput Graph; 2024 Dec; 30(12):7500-7517. PubMed ID: 38194373
    [TBL] [Abstract][Full Text] [Related]  

  • 14. tidy tree: A New Layout for Phylogenetic Trees.
    Penel S; de Vienne DM
    Mol Biol Evol; 2022 Oct; 39(10):. PubMed ID: 36161327
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 17. Smashing peacocks further: drawing quasi-trees from biconnected components.
    Archambault D; Munzner T; Auber D
    IEEE Trans Vis Comput Graph; 2006; 12(5):813-20. PubMed ID: 17080804
    [TBL] [Abstract][Full Text] [Related]  

  • 18. STRATISFIMAL LAYOUT: A modular optimization model for laying out layered node-link network visualizations.
    di Bartolomeo S; Riedewald M; Gatterbauer W; Dunne C
    IEEE Trans Vis Comput Graph; 2022 Jan; 28(1):324-334. PubMed ID: 34596540
    [TBL] [Abstract][Full Text] [Related]  

  • 19. SpicyNodes: radial layout authoring for the general public.
    Douma M; Ligierko G; Ancuta O; Gritsai P; Liu S
    IEEE Trans Vis Comput Graph; 2009; 15(6):1089-96. PubMed ID: 19834176
    [TBL] [Abstract][Full Text] [Related]  

  • 20. An Information-Theoretic Framework for Evaluating Edge Bundling Visualization.
    Wu J; Zhu F; Liu X; Yu H
    Entropy (Basel); 2018 Aug; 20(9):. PubMed ID: 33265714
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.