{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T14:06:56Z","timestamp":1790518016289,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540873600","type":"print"},{"value":"9783540873617","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87361-7_19","type":"book-chapter","created":{"date-parts":[[2008,9,17]],"date-time":"2008-09-17T12:59:00Z","timestamp":1221656340000},"page":"222-232","source":"Crossref","is-referenced-by-count":27,"title":["An Algorithm for Orienting Graphs Based on Cause-Effect Pairs and Its Applications to Orienting Protein Networks"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Medvedovsky","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vineet","family":"Bafna","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Uri","family":"Zwick","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Roded","family":"Sharan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"3","key":"19_CR1","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/S0166-218X(01)00228-1","volume":"116","author":"E.M. Arkin","year":"2002","unstructured":"Arkin, E.M., Hassin, R.: A note on orientations of mixed graphs. Discrete Applied Mathematics\u00a0116(3), 271\u2013278 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"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\u2013189 (1995)","DOI":"10.1109\/ISTCS.1995.377033"},{"issue":"21","key":"19_CR3","doi-asserted-by":"publisher","first-page":"5391","DOI":"10.1111\/j.1742-4658.2005.04973.x","volume":"272","author":"S. Fields","year":"2005","unstructured":"Fields, S.: High-throughput two-hybrid analysis the promise and the peril. Febs. J.\u00a0272(21), 5391\u20135399 (2005)","journal-title":"Febs. J."},{"issue":"5","key":"19_CR4","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S0020-0190(97)00129-4","volume":"63","author":"S.L. Hakimi","year":"1997","unstructured":"Hakimi, S.L., Schmeichel, E., Young, N.E.: Orienting graphs to optimize reachability. Information Processing Letters\u00a063(5), 229\u2013235 (1997)","journal-title":"Information Processing Letters"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1016\/0024-3795(89)90481-3","volume":"114\/115","author":"R. Hassin","year":"1989","unstructured":"Hassin, R., Megiddo, N.: On orientations and shortest paths. Linear Algebra and its applications\u00a0114\/115, 589\u2013602 (1989)","journal-title":"Linear Algebra and its applications"},{"issue":"4","key":"19_CR6","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1145\/502090.502098","volume":"48","author":"J. H\u00e5stad","year":"2001","unstructured":"H\u00e5stad, J.: Some optimal inapproximability results. Journal of the ACM\u00a048(4), 798\u2013859 (2001)","journal-title":"Journal of the ACM"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0166-218X(83)90080-X","volume":"6","author":"D.S. Hochbaum","year":"1983","unstructured":"Hochbaum, D.S.: Efficient bounds for the stable set, vertex cover and set packing problems. Discrete Applied Mathematics\u00a06, 243\u2013254 (1983)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"19_CR8","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0020-0190(96)00046-4","volume":"58","author":"V. Kann","year":"1996","unstructured":"Kann, V., Lagergren, J., Panconesi, A.: Approximability of maximum splitting of k-sets and some other apx-complete problems. Information Processing Letters\u00a058(3), 105\u2013110 (1996)","journal-title":"Information Processing Letters"},{"key":"19_CR9","first-page":"67","volume-title":"Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization","author":"M. Lewin","year":"2002","unstructured":"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\u201382. Springer, Heidelberg (2002)"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1038\/nature04187","volume":"438","author":"J. Ptacek","year":"2005","unstructured":"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\u00a0438, 679\u2013684 (2005)","journal-title":"Nature"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1093\/nar\/gkh086","volume":"32","author":"L. Salwinski","year":"2004","unstructured":"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\u00a032, D449 (2004)","journal-title":"Nucleic Acids Research"},{"issue":"2\/3","key":"19_CR12","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1089\/1066527041410382","volume":"11","author":"C.-H. Yeang","year":"2004","unstructured":"Yeang, C.-H., Ideker, T., Jaakkola, T.: Physical network models. Journal of Computational Biology\u00a011(2\/3), 243\u2013262 (2004)","journal-title":"Journal of Computational Biology"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87361-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T23:36:07Z","timestamp":1738366567000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87361-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540873600","9783540873617"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87361-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}