{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:08:10Z","timestamp":1750306090422,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":2,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,8,20]],"date-time":"2017-08-20T00:00:00Z","timestamp":1503187200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1622526,IIS-1566219"],"award-info":[{"award-number":["IIS-1622526,IIS-1566219"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,8,20]]},"DOI":"10.1145\/3107411.3107486","type":"proceedings-article","created":{"date-parts":[[2017,8,24]],"date-time":"2017-08-24T11:58:11Z","timestamp":1503575891000},"page":"394-399","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Differential Compound Prioritization via Bi-Directional Selectivity Push with Power"],"prefix":"10.1145","author":[{"given":"Junfeng","family":"Liu","sequence":"first","affiliation":[{"name":"Indiana University - Purdue University Indianapolis, Indianapolis, IN, USA"}]},{"given":"Xia","family":"Ning","sequence":"additional","affiliation":[{"name":"Indiana University - Purdue University Indianapolis, Indianapolis, IN, USA"}]}],"member":"320","published-online":{"date-parts":[[2017,8,20]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Shivani Agarwal. 2011. The Infinite Push: A new Support Vector Ranking Algorithm that Directly Optimizes Accuracy at the Absolute Top of the List. 839--850.  Shivani Agarwal. 2011. The Infinite Push: A new Support Vector Ranking Algorithm that Directly Optimizes Accuracy at the Absolute Top of the List. 839--850.","key":"e_1_3_2_1_1_1","DOI":"10.1137\/1.9781611972818.72"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1021\/ci9003865"}],"event":{"sponsor":["SIGBio ACM Special Interest Group on Bioinformatics"],"acronym":"BCB '17","name":"BCB '17: 8th ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics","location":"Boston Massachusetts USA"},"container-title":["Proceedings of the 8th ACM International Conference on Bioinformatics, Computational Biology,and Health Informatics"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3107411.3107486","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3107411.3107486","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3107411.3107486","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:21Z","timestamp":1750217421000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3107411.3107486"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,20]]},"references-count":2,"alternative-id":["10.1145\/3107411.3107486","10.1145\/3107411"],"URL":"https:\/\/doi.org\/10.1145\/3107411.3107486","relation":{},"subject":[],"published":{"date-parts":[[2017,8,20]]},"assertion":[{"value":"2017-08-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}