Exploiting bounded signal flow for graph orientation based on cause-effect pairs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6595 LNCS, Issue , 2011, Pages 104-115

  Dorn, Britta ^a   Hüffner, Falk ^b   Krüger, Dominikus ^a   Niedermeier, Rolf ^c   Uhlmann, Johannes ^c  

^a UNIVERSITY OF ULM   (Germany)

^b HUMBOLDT UNIVERSITY   (Germany)

^c TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMICS; CAUSE-EFFECT; CELL REGULATION; COMMUNICATION NETWORKS; COMPLEXITY DICHOTOMIES; EDGE DIRECTION; FIXED-PARAMETER TRACTABILITY; FOLLOWING PROBLEM; NP-HARD; NP-HARD PROBLEM; OPTIMALITY; PARAMETERIZED; POLYNOMIAL-TIME APPROXIMATION ALGORITHMS; PROTEIN INTERACTION; REAL-WORLD NETWORKS; SENDER-RECEIVER PAIRS; SIGNAL FLOW; SOLVABLE CASE; UNDIRECTED NETWORK; APPLICATIONS IN COMMUNICATIONS; GRAPH ORIENTATIONS; POLYNOMIAL TIME APPROXIMATION ALGORITHMS;

COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION; SIGNAL RECEIVERS; TELECOMMUNICATION NETWORKS; APPROXIMATION ALGORITHMS; COMPLEX NETWORKS; FLOW GRAPHS;

APPROXIMATION ALGORITHMS; SIGNAL FLOW GRAPHS;

EID: 79953809656     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-19754-3_12     Document Type: Conference Paper

References (15)

1. Alm, E., Arkin, A.P.: Biological networks. Current Opinion in Structural Biology 13(2), 193-202 (2003)
2. Arnborg, S., Proskurowski, A.: Characterization and recognition of partial 3-trees. SIAM Journal on Algebraic and Discrete Methods 7(2), 305-314 (1986)
3. Bruckner, S., Hüffner, F., Karp, R.M., Shamir, R., Sharan, R.: Topology-free querying of protein interaction networks. Journal of Computational Biology 17(3), 237-252 (2010)
4. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
5. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
6. Gamzu, I., Segev, D., Sharan, R.: Improved orientations of physical networks. In: Moulton, V., Singh, M. (eds.) WABI 2010. LNCS, vol. 6293, pp. 215-225. Springer, Heidelberg (2010)
7. Guo, J., Hüffner, F., Niedermeier, R.: A structural view on parameterizing problems: distance from triviality. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol. 3162, pp. 162-173. Springer, Heidelberg (2004)
8. Hakimi, S.L., Schmeichel, E.F., Young, N.E.: Orienting graphs to optimize reachability. Information Processing Letters 63(5), 229-235 (1997)
9. Medvedovsky, A., Bafna, V., Zwick, U., Sharan, R.: An algorithm for orienting graphs based on cause-effect pairs and its applications to orienting protein networks. In: Crandall, K.A., Lagergren, J. (eds.) WABI 2008. LNCS (LNBI), vol. 5251, pp. 222-232. Springer, Heidelberg (2008)
10. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications, vol. 31. Oxford University Press, Oxford (2006)
11. Niedermeier, R.: Reflections on multivariate algorithmics and problem parameterization. In: Proc. 27th STACS. Leibniz International Proceedings in Informatics, vol. 5, pp. 17-32. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2010)
12. Salwinski, L., Miller, C.S., Smith, A.J., Pettit, F.K., Bowie, J.U., Eisenberg, D.: The database of interacting proteins: 2004 update. Nucleic Acids Research 32(Database issue), D449-D451 (2004)
13. Sharan, R., Ideker, T.: Modeling cellular machinery through biological network comparison. Nature Biotechnology 24, 427-433 (2006)
14. Silverbush, D., Elberfeld, M., Sharan, R.: Optimally orienting physical networks. In: Proc. 15th RECOMB. LNCS. Springer, Heidelberg (to appear, 2011)
15. Yeang, C.H., Ideker, T., Jaakkola, T.: Physical network models. Journal of Computational Biology 11(2-3), 243-262 (2004)