Name
Abstract | ||
|---|---|---|
Motivation: Distinguishing direct from indirect influences is a central issue in reverse engineering of biological networks because it facilitates detection and removal of false positive edges. Transitive reduction is one approach for eliminating edges reflecting indirect effects but its use in reconstructing cyclic interaction graphs with true redundant structures is problematic. Results: We present TRANSWESD, an elaborated variant of TRANSitive reduction for WEighted Signed Digraphs that overcomes conceptual problems of existing versions. Major changes and improvements concern: (i) new statistical approaches for generating high-quality perturbation graphs from systematic perturbation experiments; (ii) the use of edge weights (association strengths) for recognizing true redundant structures; (iii) causal interpretation of cycles; (iv) relaxed definition of transitive reduction; and (v) approximation algorithms for large networks. Using standardized benchmark tests, we demonstrate that our method outperforms existing variants of transitive reduction and is, despite its conceptual simplicity, highly competitive with other reverse engineering methods. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1093/bioinformatics/btq342 | BIOINFORMATICS |
Keywords | Field | DocType |
cellular network | Approximation algorithm,Graph,Transitive reduction,Inference,Biological network,Computer science,Reverse engineering,Algorithm,Theoretical computer science,Cellular network,Bioinformatics,Gene regulatory network | Journal |
Volume | Issue | ISSN |
26 | 17 | 1367-4803 |
Citations | PageRank | References |
13 | 0.98 | 19 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Steffen Klamt | 1 | 915 | 77.99 |
| Robert J Flassig | 2 | 36 | 4.76 |
| Kai Sundmacher | 3 | 49 | 12.51 |