{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:20:48Z","timestamp":1750220448354,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,1,28]],"date-time":"2021-01-28T00:00:00Z","timestamp":1611792000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,1,28]]},"DOI":"10.1145\/3448734.3450900","type":"proceedings-article","created":{"date-parts":[[2021,5,17]],"date-time":"2021-05-17T15:48:00Z","timestamp":1621266480000},"page":"1-5","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A Single Source Optimal Reachable Path Query Method for Gene Regulatory Network"],"prefix":"10.1145","author":[{"given":"Zhaoyuan","family":"Zhang","sequence":"first","affiliation":[{"name":"Northeastern University"}]},{"given":"Zhiqiong","family":"Wang","sequence":"additional","affiliation":[{"name":"Northeastern University"}]},{"given":"Ziheng","family":"Ding","sequence":"additional","affiliation":[{"name":"Northeastern University"}]},{"given":"Hanwen","family":"Wang","sequence":"additional","affiliation":[{"name":"Northeastern University"}]},{"given":"Keyi","family":"Liu","sequence":"additional","affiliation":[{"name":"Northeastern University"}]},{"given":"Weiyiqi","family":"Wang","sequence":"additional","affiliation":[{"name":"Northeastern University"}]}],"member":"320","published-online":{"date-parts":[[2021,5,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.24272\/j.issn.2095-8137.2020.215"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-016-0961-9"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-016-0961-9"},{"issue":"6","key":"e_1_3_2_1_4_1","first-page":"180","article-title":"K-nearest Neighbor Search Algorithm for Uncertain Graphs Based on Sampling","volume":"34","author":"Zhang W.","year":"2017","journal-title":"Computer Applications and Software"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2016.2535444"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/3324301.3324304"},{"issue":"7","key":"e_1_3_2_1_7_1","first-page":"53","article-title":"Fast Reliability Search in Uncertain Graphs","volume":"2","author":"Arijit K.","year":"2014","journal-title":"International Journal of Interactive Multimedia & Artificial Intelligence"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2684166"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"L. Saadeddine B. Aziz H. Akram and S. Khalid \u201cDynamic mosaicking: combining A* algorithm with fractional Brownian motion for an optimal seamline detection \u201d.IET Image Processing 2020 14(13).  L. Saadeddine B. Aziz H. Akram and S. Khalid \u201cDynamic mosaicking: combining A* algorithm with fractional Brownian motion for an optimal seamline detection \u201d.IET Image Processing 2020 14(13).","DOI":"10.1049\/iet-ipr.2019.1619"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1504\/IJCAT.2008.021380"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"W. Chen Z. Chen J. Liu and Q. Yang \u201cA Novel Shortest Path Query Algorithm \u201d Cluster Computing 2019 22(3).  W. Chen Z. Chen J. Liu and Q. Yang \u201cA Novel Shortest Path Query Algorithm \u201d Cluster Computing 2019 22(3).","DOI":"10.1007\/s10586-018-2554-8"},{"key":"e_1_3_2_1_12_1","article-title":"An Efficient Reachability Query Based Pruning Algorithm in E-health Scenario","volume":"2019","author":"Mondal S.","journal-title":".Journal of Biomedical Informatics"},{"key":"e_1_3_2_1_13_1","article-title":"Graph Pruning Based Approach for Inferring Disease Causing Genes and Associated Pathways","volume":"2019","author":"Devasia JV.","journal-title":"International Journal of Bioinformatics Research and Applications"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.3724\/SP.J.1016.2010.02219"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.3724\/SP.J.1016.2010.01378"}],"event":{"name":"CONF-CDS 2021: The 2nd International Conference on Computing and Data Science","acronym":"CONF-CDS 2021","location":"Stanford CA USA"},"container-title":["The 2nd International Conference on Computing and Data Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448734.3450900","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3448734.3450900","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:47:47Z","timestamp":1750193267000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448734.3450900"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,28]]},"references-count":15,"alternative-id":["10.1145\/3448734.3450900","10.1145\/3448734"],"URL":"https:\/\/doi.org\/10.1145\/3448734.3450900","relation":{},"subject":[],"published":{"date-parts":[[2021,1,28]]},"assertion":[{"value":"2021-05-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}