An algorithm for orienting graphs based on cause-effect pairs and its applications to orienting protein networks

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

Volumn 5251 LNBI, Issue , 2008, Pages 222-232

  Medvedovsky, Alexander ^a   Bafna, Vineet ^b   Zwick, Uri ^a   Sharan, Roded ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BIOINFORMATICS; GRAPH THEORY; NUCLEAR PROPULSION; POLYNOMIAL APPROXIMATION; PUBLIC WORKS; TECHNICAL PRESENTATIONS;

BIOLOGICAL NETWORKS; CONSTANT RATIOS; DIRECTED PATHS; EDGE DIRECTIONS; GRAPH CLASSES; GRAPH ORIENTATIONS; HIGH ACCURACIES; NP-HARD; PROTEIN NETWORKS; REAL NETWORKS; TIGHT APPROXIMATIONS; UNDIRECTED GRAPHS;

APPROXIMATION ALGORITHMS;

EID: 56649106363     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87361-7_19     Document Type: Conference Paper

References (12)

1. Arkin, E.M., Hassin, R.: A note on orientations of mixed graphs. Discrete Appiied Mathematics 116(3), 271-278 (2002)
2. Feige, U., Goemans, M.X.: Aproximating the value of two prover proof systems, with applications to MAX 2-SAT and MAX DI-CUT. in: ISTCS, pp. 182-189 (1995)
3. Fields, S.: High-throughput two-hybrid analysis the promise and the peril. Febs. J. 272(21), 5391-5399 (2005)
4. Hakimi, S.L., Schmeichel, E., Young, N.E.: Orienting graphs to optimize reachability. Information Processing Letters 63(5), 229-235 (1997)
5. Hassin, R., Megiddo, N.: On orientations and shortest paths. Linear Algebra and its applications 114/115, 589-602 (1989)
6. Håstad, J.: Some optimal inapproximability results. Journal of the ACM 48(4), 798-859 (2001)
7. Hochbaum, D.S.: Efficient bounds for the stable set, vertex cover and set packing problems. Discrete Applied Mathematics 6, 243-254 (1983)
8. Kann, V., Lagergren, J., Paneonesi, A.: Approximability of maximum splitting of k-sets and some other apx-complete problems. Information Processing Letters 58(3), 105-110 (1996)
9. Lewin, M., Livnat, D., Zwick, U.: improved rounding techniques for the MAX 2-SAT and MAX DI-CUT problems. In: Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization, London, UK, pp. 67-82. Springer, Heidelberg (2002)
10. Ptacek, J., Devgan, G., Michaud, G., Zhu, H., Zhu, X., Fasolo, J., Guo, H., Jona, G., Breitkreutz, A., Sopko, R., McCartney, R.R., Schmidt, M.C., Rachidi, N., Lee, S.J., Mah, A.S., Meng, L., Stark, M.J., Stern, D.F., De Virgilio, C., Tyers, M., Andrews, B., Gerstein, M., Schweitzer, B., Predki, P.F., Snyder, M.: Global analysis of protein phosphorylation in yeast. Nature 438, 679-684 (2005)
11. 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, D449 (2004)
12. Yeang, C.-H., Ideker, T., Jaakkola, T.: Physical network models. Journal of Computational Biology 11(2/3), 243-262 (2004)