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 *

111 related articles for article (PubMed ID: 17080804)

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

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

  • 4. WebInterViewer: visualizing and analyzing molecular interaction networks.
    Han K; Ju BH; Jung H
    Nucleic Acids Res; 2004 Jul; 32(Web Server issue):W89-95. PubMed ID: 15215357
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

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

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

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

  • 12. Fast grid layout algorithm for biological networks with sweep calculation.
    Kojima K; Nagasaki M; Miyano S
    Bioinformatics; 2008 Jun; 24(12):1433-41. PubMed ID: 18424458
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Improved algorithms for enumerating tree-like chemical graphs with given path frequency.
    Ishida Y; Zhao L; Nagamochi H; Akutsu T
    Genome Inform; 2008; 21():53-64. PubMed ID: 19425147
    [TBL] [Abstract][Full Text] [Related]  

  • 14. SwiFT: an index structure for reduced graph descriptors in virtual screening and clustering.
    Fischer JR; Rarey M
    J Chem Inf Model; 2007; 47(4):1341-53. PubMed ID: 17567122
    [TBL] [Abstract][Full Text] [Related]  

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

  • 16. Semi-supervised graph partitioning with decision trees.
    Hancock T; Mamitsuka H
    Genome Inform; 2008; 20():102-11. PubMed ID: 19425126
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Fitting a geometric graph to a protein-protein interaction network.
    Higham DJ; Rasajski M; Przulj N
    Bioinformatics; 2008 Apr; 24(8):1093-9. PubMed ID: 18344248
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Closed trail distance in a biconnected graph.
    Snasel V; Drazdilova P; Platos J
    PLoS One; 2018; 13(8):e0202181. PubMed ID: 30169516
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Trees of trees: an approach to comparing multiple alternative phylogenies.
    Nye TM
    Syst Biol; 2008 Oct; 57(5):785-94. PubMed ID: 18853364
    [TBL] [Abstract][Full Text] [Related]  

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

    [Next]    [New Search]
    of 6.