2010
DOI: 10.1016/j.artmed.2009.06.002
|View full text |Cite
|
Sign up to set email alerts
|

Hierarchically organized layout for visualization of biochemical pathways

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2010
2010
2019
2019

Publication Types

Select...
4
1
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 13 publications
(8 citation statements)
references
References 10 publications
0
8
0
Order By: Relevance
“…Graph-based approaches were used for medical visualization, for instance, by Plaza et al [41]. Hierarchical visualization layouts were considered by Tsay et al [47]. Visualization for inference has been also investigated by Park et al [39] and Park and Huh [40].…”
Section: Resultsmentioning
confidence: 99%
“…Graph-based approaches were used for medical visualization, for instance, by Plaza et al [41]. Hierarchical visualization layouts were considered by Tsay et al [47]. Visualization for inference has been also investigated by Park et al [39] and Park and Huh [40].…”
Section: Resultsmentioning
confidence: 99%
“…Although this algorithm can appear trivial, it is widely used to visualize complexes and pathways [10]. …”
Section: Methodsmentioning
confidence: 99%
“…The main advantage of the Tree Layout algorithm is its low complexity (generally, it has linear performance in the number of nodes both for binary and n-ary trees) how demonstrated in [17] that makes it efficient and scalable, even with large graphs, but it presents a problem when arranging a huge number of nodes in limited areas as the monitor. Finally, the Tree Layout algorithm provides a natural way to visualize the global structure of a complex pathway [10]. …”
Section: Methodsmentioning
confidence: 99%
“…In this case, if the experiments confirm this relation, the algorithms can be used as predictors. Examples of algorithms for individuation of protein complexes are the Molecular Complex Detection algorithm (MCODE) 6 , described in the early work of Bader et al, [24], and The Markov Cluster algorithm (MCL) 7 [25,26] finds clusters on a graph by simulating a stochastic flow and then analyzing its distribution.…”
Section: Individuation Of Protein Complexesmentioning
confidence: 99%
“…• Circular Layout Algorithm [6]: how the name suggests, places the graph nodes in succession, one after the other, on a circle, so that all nodes are at the same distance from the center of the screen, It attempts to minimize overlapping vertices and cross edges (also named overlapping edges). Although this algorithm can appear trivial, it is widely used to visualize complexes and pathways .…”
Section: Visualization Of Graph-based Biomedical Datamentioning
confidence: 99%