{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:29:47Z","timestamp":1725532187248},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,4]]},"DOI":"10.1109\/ipdps.2008.4536180","type":"proceedings-article","created":{"date-parts":[[2008,6,6]],"date-time":"2008-06-06T12:44:52Z","timestamp":1212756292000},"page":"1-8","source":"Crossref","is-referenced-by-count":1,"title":["Parallel, scalable, memory-efficient backtracking for combinatoria modeling of large-scale biological systems"],"prefix":"10.1109","author":[{"given":"Byung-Hoon","family":"Park","sequence":"first","affiliation":[]},{"given":"Matthew","family":"Schmidt","sequence":"additional","affiliation":[]},{"given":"Kevin","family":"Thomas","sequence":"additional","affiliation":[]},{"given":"Tatiana","family":"Karpinets","sequence":"additional","affiliation":[]},{"given":"Nagiza F.","family":"Samatova","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/17.12.1198"},{"key":"14","first-page":"487","article-title":"fast algorithms for mining association rules","author":"agrawal","year":"1994","journal-title":"The 20th Intern'l Conference on Very Large Data Bases (VLDB)"},{"year":"0","key":"11"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2005.29"},{"key":"3","article-title":"the data locality of work stealing","author":"umut","year":"2000","journal-title":"The 12th annual ACM symposium on Parallel algorithms and architectures"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362367"},{"key":"1","article-title":"fundamentals of algorithmics","author":"brassard","year":"1996","journal-title":"Prentice Hall"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/s10142-002-0058-2"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1128\/AEM.71.11.6831-6837.2005"},{"key":"6","article-title":"a recursive model for graph mining","author":"chakrabarti","year":"2004","journal-title":"SIAM Intern'l Conference on Data Mining"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1994.1070"},{"key":"4","article-title":"scalable distributed depth-first search with greedy work stealing","author":"joxan","year":"2004","journal-title":"The 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'04)"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1091\/mbc.11.12.4241"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1002\/yea.1065"}],"event":{"name":"Distributed Processing Symposium (IPDPS)","start":{"date-parts":[[2008,4,14]]},"location":"Miami, FL, USA","end":{"date-parts":[[2008,4,18]]}},"container-title":["2008 IEEE International Symposium on Parallel and Distributed Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4519061\/4536075\/04536180.pdf?arnumber=4536180","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,16]],"date-time":"2017-03-16T12:30:04Z","timestamp":1489667404000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4536180\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/ipdps.2008.4536180","relation":{},"ISSN":["1530-2075"],"issn-type":[{"type":"print","value":"1530-2075"}],"subject":[],"published":{"date-parts":[[2008,4]]}}}