1991
DOI: 10.1049/el:19910710
|View full text |Cite
|
Sign up to set email alerts
|

Fast vicinity-upgrade algorithm for rectilinear steiner trees

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2017
2017
2017
2017

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 0 publications
0
3
0
Order By: Relevance
“…The FTD seeds were mapped to the weighted interactome, and a FTD-related sub-network was constructed by adding new genes to connect FTD genes solving a Steiner tree problem [ 30 33 ], minimizing the sum of weights of every edge in the sub-graph. We applied a modified shortest path heuristic (SPH) distance algorithm, from Kou et al .…”
Section: Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…The FTD seeds were mapped to the weighted interactome, and a FTD-related sub-network was constructed by adding new genes to connect FTD genes solving a Steiner tree problem [ 30 33 ], minimizing the sum of weights of every edge in the sub-graph. We applied a modified shortest path heuristic (SPH) distance algorithm, from Kou et al .…”
Section: Methodsmentioning
confidence: 99%
“…We applied a modified shortest path heuristic (SPH) distance algorithm, from Kou et al . solution [ 33 ], implemented in our subnet() R function. Our algorithm selected outgoing shortest paths combing the edge weights by Fisher’s method and testing the statistical significance (p < 0.05) with multiple comparison Bonferroni correction.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation