Efficient reconstruction of biological networks via transitive reduction on general purpose graphics processors

BMC Bioinformatics

Volumn 13, Issue 1, 2012, Pages

  Bošnački, Dragan ^a   Odenbrett, Maximilian R ^a   Wijs, Anton ^a   Ligtenberg, Willem ^a   Hilbers, Peter ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BIOLOGICAL NETWORKS; DIRECT INTERACTIONS; EDGE WEIGHTS; EFFICIENT RECONSTRUCTION; GENERAL PURPOSE; GRAPHICS PROCESSING UNIT; GRAPHICS PROCESSOR; INDIRECT INTERACTIONS; INDIRECT PATHS; LARGE NETWORKS; NEGATIVE INTERACTION; NP COMPLETE; ORDERS OF MAGNITUDE; PARALLEL IMPLEMENTATIONS; RECONSTRUCTION QUALITY; REMOVAL CONDITIONS; TRANSITIVE REDUCTIONS; UNWEIGHTED GRAPHS; WEIGHTED GRAPH;

COMPUTER GRAPHICS; EXPERIMENTS; PROGRAM PROCESSORS;

ALGORITHMS;

ALGORITHM; ARTICLE; COMPUTER GRAPHICS; GENE REGULATORY NETWORK; METABOLISM;

ALGORITHMS; COMPUTER GRAPHICS; GENE REGULATORY NETWORKS; METABOLIC NETWORKS AND PATHWAYS;

MLCS; MLOWN;

EID: 84874388828     PISSN: None     EISSN: 14712105     Source Type: Journal    
DOI: 10.1186/1471-2105-13-281     Document Type: Article

References (26)

1. Aho AV, Garey MR, Ullman JD. The transitive reduction of a directed graph. SIAM J Comput 1972, 1(2):131-137.
2. Hu Z, Killion P, Iyer V. Genetic reconstruction of a functional transcriptional regulatory network. Nat Genet 2007, 39(5):683-687. 10.1038/ng2012, 17417638.
3. 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, 1764484, 17254312.
4. Tresch A, Beissbarth T, Sültmann 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-1228. 10.1089/cmb.2007.0085, 17990974.
5. Wagner A. How to reconstruct a large genetic network from n gene perturbations in fewer than n2 easy steps. Bioinformatics 2001, 17(12):1183-1197. 10.1093/bioinformatics/17.12.1183, 11751227.
6. 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-155.
7. Goralčíková A, Koubek V. A reduct-and-closure algorithm for graphs. Mathematical Foundations of Computer Science 1979, Volume 74 of Lecture Notes in Computer Science 1979, 301-307. Berlin/Heidelberg: Springer, Becvár J.
8. Klamt S, Flassig RJ, Sundmacher K. Transwesd: inferring cellular networks with transitive reduction. Bioinformatics 2010, 26:2160-2168. 10.1093/bioinformatics/btq342, 2922889, 20605927.
9. Ding C, He X, Xiong H, Peng H, Holbrook SR. Transitive closure and metric inequality of weighted graphs - detecting protein interaction modules using cliques. Int J Data Min Bioinformatics 2006, 1(2):162-177.
10. Stolovitzky G, Prill RJ, Califano A. Lessons from the Dream2 Challenges. Ann New York Acad Sci 2009, 1158:159-195.
11. Hirschberg DS. Parallel algorithms for the transitive closure and the connected component problems. Proceedings of the eighth annual ACM symposium on Theory of computing, STOC '76 1976, 55-57. New York: ACM, http://doi.acm.org/10.1145/800113.803631.
12. 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-507.
13. Chang P, Henschen L. Parallel transitive closure and transitive reduction algorithms. Int Conference on Databases, Parallel Architectures and Their Applications, PARBASE-90 1990, 152-154. Washington D.C.: IEEE Computer Society Press.
14. 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, 2952592, 20949005.
15. Mangan S, Alon U. Structure and function of the feed-forward loop network motif. PNAS 2003, 100:11980-11985. 10.1073/pnas.2133841100, 218699, 14530388.
16. Moore G. Cramming more components onto integrated circuits. Electronics 1965, 38(10):114-117.
17. Parallel Programming and Computing Platform - CUDA - NVIDIA. http://www.nvidia.com/object/cuda_home_new.html.
18. Warshall S. A theorem on boolean matrices. J ACM 1962, 9:11-12.
19. Floyd RW. Algorithm 97: Shortest path. CommunACM 1962, 5(6):345.
20. Micikevicius P. GPU computing for protein structure prediction. GPU Gems 2: Programming Techniques for High-Performance Graphics and General-Purpose Computation 2005, 695-702. London: Addison-Wesley, Pharr M, Fernando R, http://www.the-dream-project.org.
21. Bollobás B, Borgs C, Chayes J, Riordan O. Directed scale-free graphs. Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '03 2003, 132-139. Philadelphia: Society for Industrial and Applied Mathematics.
22. Erdo{combining double acute accent} s P, Rényi A. On the evolution of random graphs. Publications of the Math Ins Hungarian Acad Sci 1960, 5:17-61.
23. 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. http://www.biomedcentral.com/1471-2105/7/43, 10.1186/1471-2105-7-43, 1373604, 16438721.
24. The DREAM project. http://wiki.c2b2.columbia.edu/dream/index.php/The_DREAM_Project.
25. 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-239. 10.1089/cmb.2008.09TT, 19183003.
26. CUTTER - CUDA Technology based TransitivE Reduction of Networks. http://www.win.tue.nl/emcmc/cutter.