{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T19:39:09Z","timestamp":1740166749005,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T00:00:00Z","timestamp":1559952000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T00:00:00Z","timestamp":1559952000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Netw Model Anal Health Inform Bioinforma"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s13721-019-0194-4","type":"journal-article","created":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T14:02:36Z","timestamp":1560002556000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the parameterized complexity of the problem of inferring protein\u2013protein interaction directions based on cause\u2013effect pairs"],"prefix":"10.1007","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9843-5886","authenticated-orcid":false,"given":"Mehdy","family":"Roayaei","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,8]]},"reference":[{"issue":"3","key":"194_CR1","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/S0166-218X(01)00228-1","volume":"116","author":"EM Arkin","year":"2002","unstructured":"Arkin EM, Hassin R (2002) A note on orientations of mixed graphs. Discrete Appl Math 116(3):271\u2013278","journal-title":"Discrete Appl Math"},{"issue":"10\u201311","key":"194_CR2","doi-asserted-by":"publisher","first-page":"1634","DOI":"10.1016\/j.dam.2012.02.017","volume":"160","author":"S B\u00f6cker","year":"2012","unstructured":"B\u00f6cker S, Damaschke P (2012) A note on the parameterized complexity of unordered maximum tree orientation. Discrete Appl Math 160(10\u201311):1634\u20131638","journal-title":"Discrete Appl Math"},{"issue":"1","key":"194_CR3","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/s11390-005-0003-7","volume":"20","author":"JE Chen","year":"2005","unstructured":"Chen JE (2005) Parameterized computation and complexity: a new approach dealing with NP-hardness. J Comput Sci Technol 20(1):18\u201337","journal-title":"J Comput Sci Technol"},{"issue":"5","key":"194_CR4","doi-asserted-by":"publisher","first-page":"870","DOI":"10.1007\/s11390-014-1474-1","volume":"29","author":"J Chen","year":"2014","unstructured":"Chen J, Feng QL (2014) On unknown small subsets and implicit measures: new techniques for parameterized algorithms. J Comput Sci Technol 29(5):870\u2013878","journal-title":"J Comput Sci Technol"},{"issue":"1","key":"194_CR5","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1186\/1748-7188-6-21","volume":"6","author":"B Dorn","year":"2011","unstructured":"Dorn B, H\u00fcffner F, Kr\u00fcger D, Niedermeier R, Uhlmann J (2011) Exploiting bounded signal flow for graph orientation based on cause\u2013effect pairs. Algorithm Mol Biol 6(1):21","journal-title":"Algorithm Mol Biol"},{"key":"194_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of parameterized complexity","author":"RG Downey","year":"2013","unstructured":"Downey RG, Fellows MR (2013) Fundamentals of parameterized complexity, vol 4. Springer, London"},{"key":"194_CR7","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.tcs.2012.03.044","volume":"483","author":"M Elberfeld","year":"2013","unstructured":"Elberfeld M, Segev D, Davidson CR, Silverbush D, Sharan R (2013) Approximation algorithms for orienting mixed graphs. Theor Comput Sci 483:96\u2013103","journal-title":"Theor Comput Sci"},{"key":"194_CR8","first-page":"463","volume":"2","author":"P Erd\u00f6s","year":"1935","unstructured":"Erd\u00f6s P, Szekeres G (1935) A combinatorial problem in geometry. Compos Math 2:463\u2013470","journal-title":"Compos Math"},{"issue":"21","key":"194_CR9","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 (2005) High-throughput two-hybrid analysis. FEBS J 272(21):5391\u20135399","journal-title":"FEBS J"},{"issue":"1","key":"194_CR10","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00453-014-9932-2","volume":"74","author":"I Gamzu","year":"2016","unstructured":"Gamzu I, Medina M (2016) Improved approximation for orienting mixed graphs. Algorithmica 74(1):49\u201364","journal-title":"Algorithmica"},{"key":"194_CR11","first-page":"215","volume-title":"Lecture Notes in Computer Science","author":"Iftah Gamzu","year":"2010","unstructured":"Gamzu I, Segev D, Sharan R (2010) Improved orientations of physical networks. In: Moulton V, Singh M (eds) Algorithms in bioinformatics. WABI 2010. Lecture notes in computer science, vol 6293. Springer, Berlin, pp 215\u2013225"},{"issue":"6868","key":"194_CR12","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1038\/415141a","volume":"415","author":"AC Gavin","year":"2002","unstructured":"Gavin AC, B\u00f6sche M, Krause R, Grandi P, Marzioch M, Bauer A, Remor M (2002) Functional organization of the yeast proteome by systematic analysis of protein complexes. Nature 415(6868):141","journal-title":"Nature"},{"key":"194_CR13","doi-asserted-by":"crossref","unstructured":"Medvedovsky A, Bafna V, Zwick U, Sharan R (2008) An algorithm for orienting graphs based on cause-effect pairs and its applications to orienting protein networks. In: Crandall KA, Lagergren J (eds) Algorithms in bioinformatics. WABI 2008. Lecture notes in computer science, vol 5251. Springer, Berlin, pp 222\u2013232","DOI":"10.1007\/978-3-540-87361-7_19"},{"key":"194_CR14","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to fixed-parameter algorithms","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier R (2006) Invitation to fixed-parameter algorithms. Oxford University Press, UK"},{"issue":"11","key":"194_CR15","doi-asserted-by":"publisher","first-page":"1437","DOI":"10.1089\/cmb.2011.0163","volume":"18","author":"D Silverbush","year":"2011","unstructured":"Silverbush D, Elberfeld M, Sharan R (2011) Optimally orienting physical networks. J Comput Biol 18(11):1437\u20131448","journal-title":"J Comput Biol"},{"issue":"2\u20133","key":"194_CR16","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1089\/1066527041410382","volume":"11","author":"CH Yeang","year":"2004","unstructured":"Yeang CH, Ideker T, Jaakkola T (2004) Physical network models. J Comput Biol 11(2\u20133):243\u2013262","journal-title":"J Comput Biol"},{"issue":"1","key":"194_CR17","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/BF02946660","volume":"18","author":"X Zhao","year":"2003","unstructured":"Zhao X, Ding D (2003) Fixed-parameter tractability of disjunction-free default reasoning. J Comput Sci Technol 18(1):118","journal-title":"J Comput Sci Technol"}],"container-title":["Network Modeling Analysis in Health Informatics and Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13721-019-0194-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13721-019-0194-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13721-019-0194-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,6]],"date-time":"2020-06-06T23:18:16Z","timestamp":1591485496000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13721-019-0194-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,8]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["194"],"URL":"https:\/\/doi.org\/10.1007\/s13721-019-0194-4","relation":{},"ISSN":["2192-6662","2192-6670"],"issn-type":[{"type":"print","value":"2192-6662"},{"type":"electronic","value":"2192-6670"}],"subject":[],"published":{"date-parts":[[2019,6,8]]},"assertion":[{"value":"2 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"11"}}