Information and Hardness Quantification of Graphs: A Computational Study
作者： Brent Dutson
DOI:
关键词:
摘要:
参考文章(22)
Scale‐Free Networks John Wiley & Sons, Inc.. pp. 177- 215 ,(2008) , 10.1002/9780470400791.CH6
Matt Ridley, Genome: The Autobiography of a Species In 23 Chapters ,(1999)
Sanjeev Arora, Boaz Barak, Computational Complexity: A Modern Approach Cambridge University Press. ,(2009) , 10.1017/CBO9780511804090
Matti Nykter, Ilya Shmulevich, David J. Galas, Gregory W. Carter, Nathan D. Price, Set-based Complexity and Biological Information arXiv: Information Theory. ,(2008)
Entropy, Relative Entropy and Mutual Information John Wiley & Sons, Inc.. pp. 12- 49 ,(2001) , 10.1002/0471200611.CH2
Small‐World Networks John Wiley & Sons, Inc.. pp. 131- 175 ,(2008) , 10.1002/9780470400791.CH5
Handbook of Graphs and Networks: From the Genome to the Internet Handbook of Graphs and Networks: From the Genome to the Internet. pp. 417- ,(2003) , 10.1002/3527602755
Paul Vitányi, Ming Li, An Introduction to Kolmogorov Complexity and Its Applications ,(1993)
Nicholas S. Flann, Hamid Mohamadlou, Gregory J. Podgorski, Kolmogorov complexity of epithelial pattern formation: the role of regulatory network configuration. BioSystems. ,vol. 112, pp. 131- 138 ,(2013) , 10.1016/J.BIOSYSTEMS.2013.03.005
Gregory W. Carter, David J. Galas, Timothy Galitski, Maximal Extraction of Biological Information from Genetic Interaction Data PLoS Computational Biology. ,vol. 5, pp. e1000347- ,(2009) , 10.1371/JOURNAL.PCBI.1000347