BioGraphE: high-performance bionetwork analysis using the Biological Graph Environment

@article{citeulike:2939159, abstract = {BACKGROUND:Graphs and networks are common analysis representations for biological systems. Many traditional graph algorithms such as k-clique, k-coloring, and subgraph matching have great potential as analysis techniques for newly available data in biology. Yet, as the amount of genomic and bionetwork information rapidly grows, scientists need advanced new computational strategies and tools for dealing with the complexities of the bionetwork analysis and the volume of the data.RESULTS:We introduce a computational framework for graph analysis called the Biological Graph Environment (BioGraphE), which provides a general, scalable integration platform for connecting graph problems in biology to optimized computational solvers and high-performance systems. This framework enables biology researchers and computational scientists to identify and deploy network analysis applications and to easily connect them to efficient and powerful computational software and hardware that are specifically designed and tuned to solve complex graph problems. In our particular application of BioGraphE to support network analysis in genome biology, we investigate the use of a Boolean satisfiability solver known as Survey Propagation as a core computational solver executing on standard high-performance parallel systems, as well as multi-threaded architectures.CONCLUSION:In our application of BioGraphE to conduct bionetwork analysis of homology networks, we found that BioGraphE and a custom, parallel implementation of the Survey Propagation SAT solver were capable of solving very large bionetwork problems at high rates of execution on different high-performance computing platforms.}, author = {Chin, George and Chavarria, Daniel and Nakamura, Grant and Sofia, Heidi }, citeulike-article-id = {2939159}, doi = {http://dx.doi.org/10.1186/1471-2105-9-S6-S6}, journal = {BMC Bioinformatics}, keywords = {graph, network}, number = {Suppl 6}, posted-at = {2008-06-28 13:39:49}, priority = {2}, title = {BioGraphE: high-performance bionetwork analysis using the Biological Graph Environment}, url = {http://dx.doi.org/10.1186/1471-2105-9-S6-S6}, volume = {9}, year = {2008} }

TY - JOUR ID - citeulike:2939159 L3 - citeulike-article-id:2939159 TI - BioGraphE: high-performance bionetwork analysis using the Biological Graph Environment JF - BMC Bioinformatics VL - 9 IS - Suppl 6 N2 - BACKGROUND:Graphs and networks are common analysis representations for biological systems. Many traditional graph algorithms such as k-clique, k-coloring, and subgraph matching have great potential as analysis techniques for newly available data in biology. Yet, as the amount of genomic and bionetwork information rapidly grows, scientists need advanced new computational strategies and tools for dealing with the complexities of the bionetwork analysis and the volume of the data.RESULTS:We introduce a computational framework for graph analysis called the Biological Graph Environment (BioGraphE), which provides a general, scalable integration platform for connecting graph problems in biology to optimized computational solvers and high-performance systems. This framework enables biology researchers and computational scientists to identify and deploy network analysis applications and to easily connect them to efficient and powerful computational software and hardware that are specifically designed and tuned to solve complex graph problems. In our particular application of BioGraphE to support network analysis in genome biology, we investigate the use of a Boolean satisfiability solver known as Survey Propagation as a core computational solver executing on standard high-performance parallel systems, as well as multi-threaded architectures.CONCLUSION:In our application of BioGraphE to conduct bionetwork analysis of homology networks, we found that BioGraphE and a custom, parallel implementation of the Survey Propagation SAT solver were capable of solving very large bionetwork problems at high rates of execution on different high-performance computing platforms. KW - graph KW - network AU - Chin, George AU - Chavarria, Daniel AU - Nakamura, Grant AU - Sofia, Heidi PY - 2008/// UR - http://dx.doi.org/10.1186/1471-2105-9-S6-S6 ER -