{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T16:38:34Z","timestamp":1732034314597},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,10,30]],"date-time":"2012-10-30T00:00:00Z","timestamp":1351555200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1186\/1471-2105-13-281","type":"journal-article","created":{"date-parts":[[2012,10,31]],"date-time":"2012-10-31T13:17:43Z","timestamp":1351689463000},"source":"Crossref","is-referenced-by-count":12,"title":["Efficient reconstruction of biological networks via transitive reduction on general purpose graphics processors"],"prefix":"10.1186","volume":"13","author":[{"given":"Dragan","family":"Bo\u0161na\u010dki","sequence":"first","affiliation":[]},{"given":"Maximilian R","family":"Odenbrett","sequence":"additional","affiliation":[]},{"given":"Anton","family":"Wijs","sequence":"additional","affiliation":[]},{"given":"Willem","family":"Ligtenberg","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Hilbers","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,10,30]]},"reference":[{"issue":"2","key":"5686_CR1","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1137\/0201008","volume":"1","author":"AV Aho","year":"1972","unstructured":"Aho AV, Garey MR, Ullman JD: The transitive reduction of a directed graph. SIAM J Comput 1972, 1(2):131\u2013137. 10.1137\/0201008","journal-title":"SIAM J Comput"},{"issue":"5","key":"5686_CR2","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1038\/ng2012","volume":"39","author":"Z Hu","year":"2007","unstructured":"Hu Z, Killion P, Iyer V: Genetic reconstruction of a functional transcriptional regulatory network. Nat Genet 2007, 39(5):683\u2013687. 10.1038\/ng2012","journal-title":"Nat Genet"},{"issue":"Suppl 1","key":"5686_CR3","doi-asserted-by":"publisher","first-page":"S7","DOI":"10.1186\/1471-2105-7-S1-S7","volume":"7","author":"A Margolin","year":"2006","unstructured":"Margolin A, Nemenman I, Basso K, Wiggins C, Stolovitzky G, Favera R, Califano A: Aracne: An algorithm for the reconstruction of gene regulatory networks in a mammalian cellular context. BMC Bioinformatics 2006, 7(Suppl 1):S7. 10.1186\/1471-2105-7-S1-S7","journal-title":"BMC Bioinformatics"},{"issue":"9","key":"5686_CR4","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1089\/cmb.2007.0085","volume":"14","author":"A Tresch","year":"2007","unstructured":"Tresch A, Beissbarth T, S\u00fcltmann H, Kuner R, Poustka A, Buness A: Discrimination of direct and indirect interactions in a network of regulatory effects. J Comput Biol 2007, 14(9):1217\u20131228. 10.1089\/cmb.2007.0085","journal-title":"J Comput Biol"},{"issue":"12","key":"5686_CR5","doi-asserted-by":"publisher","first-page":"1183","DOI":"10.1093\/bioinformatics\/17.12.1183","volume":"17","author":"A Wagner","year":"2001","unstructured":"Wagner A: How to reconstruct a large genetic network from n gene perturbations in fewer than n2 easy steps. Bioinformatics 2001, 17(12):1183\u20131197. 10.1093\/bioinformatics\/17.12.1183","journal-title":"Bioinformatics"},{"issue":"2","key":"5686_CR6","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0167-6423(89)90039-7","volume":"12","author":"D Gries","year":"1989","unstructured":"Gries D, Martin AJ, van de Snepscheut JL, Udding JT: An algorithm for transitive reduction of an acyclic graph. Sci Comp Progr 1989, 12(2):151\u2013155. 10.1016\/0167-6423(89)90039-7","journal-title":"Sci Comp Progr"},{"key":"5686_CR7","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/3-540-09526-8_27","volume-title":"Mathematical Foundations of Computer Science 1979, Volume 74 of Lecture Notes in Computer Science","author":"A Goral\u010d\u00edkov\u00e1","year":"1979","unstructured":"Goral\u010d\u00edkov\u00e1 A, Koubek V: A reduct-and-closure algorithm for graphs. In Mathematical Foundations of Computer Science 1979, Volume 74 of Lecture Notes in Computer Science. Edited by: Becv\u00e1r J. Berlin\/Heidelberg: Springer; 1979:301\u2013307."},{"key":"5686_CR8","doi-asserted-by":"publisher","first-page":"2160","DOI":"10.1093\/bioinformatics\/btq342","volume":"26","author":"S Klamt","year":"2010","unstructured":"Klamt S, Flassig RJ, Sundmacher K: Transwesd: inferring cellular networks with transitive reduction. Bioinformatics 2010, 26: 2160\u20132168. 10.1093\/bioinformatics\/btq342","journal-title":"Bioinformatics"},{"issue":"2","key":"5686_CR9","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1504\/IJDMB.2006.010854","volume":"1","author":"C Ding","year":"2006","unstructured":"Ding C, He X, Xiong H, Peng H, Holbrook SR: Transitive closure and metric inequality of weighted graphs \u2013 detecting protein interaction modules using cliques. Int J Data Min Bioinformatics 2006, 1(2):162\u2013177. 10.1504\/IJDMB.2006.010854","journal-title":"Int J Data Min Bioinformatics"},{"key":"5686_CR10","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1111\/j.1749-6632.2009.04497.x","volume":"1158","author":"G Stolovitzky","year":"2009","unstructured":"Stolovitzky G, Prill RJ, Califano A: Lessons from the Dream2 Challenges. Ann New York Acad Sci 2009, 1158: 159\u2013195. 10.1111\/j.1749-6632.2009.04497.x","journal-title":"Ann New York Acad Sci"},{"key":"5686_CR11","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1145\/800113.803631","volume-title":"Proceedings of the eighth annual ACM symposium on Theory of computing, STOC \u201976","author":"DS Hirschberg","year":"1976","unstructured":"Hirschberg DS: Parallel algorithms for the transitive closure and the connected component problems. In Proceedings of the eighth annual ACM symposium on Theory of computing, STOC \u201976. New York: ACM; 1976:55\u201357. \n                    http:\/\/doi.acm.org\/10.1145\/800113.803631"},{"issue":"4","key":"5686_CR12","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1109\/71.80177","volume":"1","author":"BF Wang","year":"1990","unstructured":"Wang BF, Chen GH: Constant time algorithms for the transitive closure and some related graph problems on processor arrays with reconfigurable bus systems. IEEE Trans Parallel Distrib Syst 1990, 1(4):500\u2013507. 10.1109\/71.80177","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"5686_CR13","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1109\/PARBSE.1990.77136","volume-title":"Int Conference on Databases, Parallel Architectures and Their Applications, PARBASE-90","author":"P Chang","year":"1990","unstructured":"Chang P, Henschen L: Parallel transitive closure and transitive reduction algorithms. In Int Conference on Databases, Parallel Architectures and Their Applications, PARBASE-90. Washington D.C.: IEEE Computer Society Press; 1990:152\u2013154."},{"issue":"10","key":"5686_CR14","doi-asserted-by":"publisher","first-page":"e12912","DOI":"10.1371\/journal.pone.0012912","volume":"5","author":"A Pinna","year":"2010","unstructured":"Pinna A, Soranzo N, de la Fuente A: From knockouts to networks: establishing direct cause-effect relationships through graph analysis. PLoS ONE 2010, 5(10):e12912. 10.1371\/journal.pone.0012912","journal-title":"PLoS ONE"},{"key":"5686_CR15","doi-asserted-by":"publisher","first-page":"11980","DOI":"10.1073\/pnas.2133841100","volume":"100","author":"S Mangan","year":"2003","unstructured":"Mangan S, Alon U: Structure and function of the feed-forward loop network motif. PNAS 2003, 100: 11980\u201311985. 10.1073\/pnas.2133841100","journal-title":"PNAS"},{"issue":"10","key":"5686_CR16","first-page":"114","volume":"38","author":"G Moore","year":"1965","unstructured":"Moore G: Cramming more components onto integrated circuits. Electronics 1965, 38(10):114\u2013117.","journal-title":"Electronics"},{"key":"5686_CR17","unstructured":"Parallel Programming and Computing Platform \u2014 CUDA \u2014 NVIDIA \n                    http:\/\/www.nvidia.com\/object\/cuda_home_new.html"},{"key":"5686_CR18","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/321105.321107","volume":"9","author":"S Warshall","year":"1962","unstructured":"Warshall S: A theorem on boolean matrices. J ACM 1962, 9: 11\u201312. 10.1145\/321105.321107","journal-title":"J ACM"},{"issue":"6","key":"5686_CR19","first-page":"345","volume":"5","author":"RW Floyd","year":"1962","unstructured":"Floyd RW: Algorithm 97: Shortest path. CommunACM 1962, 5(6):345.","journal-title":"CommunACM"},{"key":"5686_CR20","first-page":"695","volume-title":"GPU Gems 2: Programming Techniques for High-Performance Graphics and General-Purpose Computation","author":"P Micikevicius","year":"2005","unstructured":"Micikevicius P: GPU computing for protein structure prediction. In GPU Gems 2: Programming Techniques for High-Performance Graphics and General-Purpose Computation. Edited by: Pharr M, Fernando R. London: Addison-Wesley; 2005:695\u2013702. \n                    http:\/\/www.the-dream-project.org"},{"key":"5686_CR21","first-page":"132","volume-title":"Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201903","author":"B Bollob\u00e1s","year":"2003","unstructured":"Bollob\u00e1s B, Borgs C, Chayes J, Riordan O: Directed scale-free graphs. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201903. Philadelphia: Society for Industrial and Applied Mathematics; 2003:132\u2013139."},{"key":"5686_CR22","first-page":"17","volume":"5","author":"P Erdo\u030bs","year":"1960","unstructured":"Erdo\u030bs P, R\u00e9nyi A: On the evolution of random graphs. Publications of the Math Ins Hungarian Acad Sci 1960, 5: 17\u201361.","journal-title":"Publications of the Math Ins Hungarian Acad Sci"},{"key":"5686_CR23","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1186\/1471-2105-7-43","volume":"7","author":"T Van den Bulcke","year":"2006","unstructured":"Van den Bulcke T, Van Leemput K, Naudts B, van Remortel P, Ma H, Verschoren A, De Moor B, Marchal K: SynTReN: a generator of synthetic gene expression data for design and analysis of structure learning algorithms. BMC Bioinformatics 2006, 7: 43. \n                    http:\/\/www.biomedcentral.com\/1471\u20132105\/7\/43\n                    \n                   10.1186\/1471-2105-7-43","journal-title":"BMC Bioinformatics"},{"key":"5686_CR24","unstructured":"The DREAM project \n                    http:\/\/wiki.c2b2.columbia.edu\/dream\/index.php\/The_DREAM_Project"},{"issue":"2","key":"5686_CR25","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1089\/cmb.2008.09TT","volume":"16","author":"D Marbach","year":"2009","unstructured":"Marbach D, Schaffter T, Mattiussi C, Floreano D: Generating realistic in silico gene networks for performance assessment of Reverse engineering methods. J Comput Biol 2009, 16(2):229\u2013239. 10.1089\/cmb.2008.09TT","journal-title":"J Comput Biol"},{"key":"5686_CR26","unstructured":"CUTTER - CUDA Technology based TransitivE Reduction of Networks \n                    http:\/\/www.win.tue.nl\/emcmc\/cutter"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-13-281.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1471-2105-13-281\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-13-281.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,22]],"date-time":"2019-01-22T04:46:45Z","timestamp":1548132405000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/1471-2105-13-281"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,30]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["5686"],"URL":"https:\/\/doi.org\/10.1186\/1471-2105-13-281","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,30]]},"article-number":"281"}}