Relations between the set-complexity and the structure of graphs and their sub-graphs
Tóm tắt
We describe some new conceptual tools for the rigorous, mathematical description of the “set-complexity” of graphs. This set-complexity has been shown previously to be a useful measure for analyzing some biological networks, and in discussing biological information in a quantitative fashion. The advances described here allow us to define some significant relationships between the set-complexity measure and the structure of graphs, and of their component sub-graphs. We show here that modular graph structures tend to maximize the set-complexity of graphs. We point out the relationship between modularity and redundancy, and discuss the significance of set-complexity in this regard. We specifically discuss the relationship between complexity and entropy in the case of complete-bipartite graphs, and present a new method for constructing highly complex, binary graphs. These results can be extended to the case of ternary graphs, and to other multi-edge graphs, which are fundamentally more relevant to biological structures and systems. Finally, our results lead us to an approach for extracting high complexity modular graphs from large, noisy graphs with low information content. We illustrate this approach with two examples.
Tài liệu tham khảo
Galas DJ, Nykter M, Carter GW, Price ND, Shmulevich I: Biological information as set-based complexity. IEEE Trans. Inf. Theory 2010, 56: 667-677.
Kolmogorov AN: Three approaches to the definition of the concept quantity of information (Russian). Probl. Peredachi Inf 1965, 1: 3-11.
Carter GW, Galas DJ, Galitski T: Maximal extraction of biological information from genetic interaction data. PLOS Comput. Biol 2009, 54: e1000347.
Carter GW, Rush CG, Uygun F, Sakhanenko NA, Galas DJ, Galitski T: A systems-biology approach to modular genetic complexity. Chaos 2010, 20: 026102. 10.1063/1.3455183
Ignac TM, Sakhanenko NA, Galas DJ: Relation between the set-complexity of a graph and its structure. In Proceedings of the Eighth International Workshop on Computational Systems Biology: 6–8 June 2011. Edited by: Koeppl H, Acimovic J, Kesseli J, Maki-Marttunen T, Larjo A, Yli-Harja O. Zurich, Switzerland: Tampere University of Technology, TICSP Series; 2011:81-84.
Cover TM, Thomas JA: Elements of Information Theory. New York: Wiley-Interscience; 1991.
Gross J, Yellen J: Graph Theory and its Applications. Boca Raton: CRC Press Inc; 1999.
Ignac TM, Sakhanenko NA, Galas DJ: Complexity of networks II: the set complexity of edge-colored graphs. Complexity 2012, 17: 23-36.
Whitfield ML, Sherlock G, Saldanha AJ, Murray JI, Ball CA, Alexander KE, Matese JC, Perou CM, Hurt MM, Brown PO, Botstein D: Identification of genes periodically expressed in the human cell cycle and their expression in tumors. Mol. Biol. Cell 2002, 13: 1977-2000. 10.1091/mbc.02-02-0030.
Maki-Marttunen T, Kesseli J, Kauffman S, Yli-Harja O, Nykter M: On the complexity of Boolean network state trajectories. In Proceedings of the Eighth International Workshop on Computational Systems Biology. Edited by: Koeppl H, Acimovic J, Kesseli J, Maki-Marttunen T, Larjo A, Yli-Harja O. Zurich, Switzerland, 6–8 June 2011: Tampere University of Technology, TICSP Series; 2011:137-140.