Using circuit structural analysis techniques for networks in systems biology

The cell contains numerous networks for information processing. These networks are responsible for carrying out all cell functions including gene transcription, signal transconduction, and metabolic activities. Many of these networks process information similar to digital logic circuits and classical logic methods have been successfully used to analyze their behavior. The objective of this paper is to investigate the potential of circuit structural analysis techniques in analyzing the topologies of cellular networks arising in systems biology context. Rent's rule has been in particular a classical method that is used in analyzing the topologies of digital circuits. We investigate the applicability of Rent's rule to systems biology networks, and we outline the structural similarities and differences between circuit networks and systems biology networks. We compute Rent's rule parameters and classify systems biology networks according to their Rent's exponent. Interestingly, networks that process information in a logical fashion have Rent exponents that are similar to that of logic circuits. To provide a basis for our results we utilize recent advancements in graph theory to create random artificial networks with the same degree sequences as real networks and extend our experiments to those circuits as well. Our results open the door for other researchers to further investigate topological circuit analysis techniques for networks in systems biology.

[1]  Matthieu Latapy,et al.  Efficient and simple generation of random simple connected graphs with prescribed degree sequence , 2005, J. Complex Networks.

[2]  Chung-Kuan Cheng,et al.  A wire length estimation technique utilizing neighborhood density equations , 1992, DAC '92.

[3]  David Bryan,et al.  Combinational profiles of sequential benchmark circuits , 1989, IEEE International Symposium on Circuits and Systems,.

[4]  Dinesh Bhatia,et al.  A priori wirelength and interconnect estimation based on circuit characteristics , 2003, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[5]  Andrew B. Kahng,et al.  Intrinsic shortest path length: a new, accurate a priori wirelength estimator , 2005, ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005..

[6]  Fadi J. Kurdahi,et al.  On the intrinsic rent parameter and spectra-based partitioning methodologies , 1992, EURO-DAC '92.

[7]  B. Palsson.  Systems Biology: Properties of Reconstructed Networks , 2006 .

[8]  W. E. Donath.  Statistical Properties of the Placement of a Graph , 1968 .

[9]  Jan M. Van Campenhout,et al.  Toward the accurate prediction of placement wire length distributions in VLSI circuits , 2004, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[10]  Roy L. Russo,et al.  On a Pin Versus Block Relationship For Partitions of Logic Graphs , 1971, IEEE Transactions on Computers.

[11]  Arun K. Ramani,et al.  Protein interaction networks from yeast to human. , 2004, Current opinion in structural biology.

[12]  Shane T. Jensen,et al.  The Program of Gene Transcription for a Single Differentiating Cell Type during Sporulation in Bacillus subtilis , 2004, PLoS biology.

[13]  Malgorzata Marek-Sadowska,et al.  Pre-layout wire length and congestion estimation , 2004, Proceedings. 41st Design Automation Conference, 2004..

[14]  G. Karypis,et al.  Multilevel k-way hypergraph partitioning , 1999, Proceedings 1999 Design Automation Conference (Cat. No. 99CH36361).

[15]  Majid Sarrafzadeh,et al.  Wirelength estimation based on rent exponents of partitioning and placement , 2001, SLIP '01.

[16]  Dirk Stroobandt,et al.  A Priori Wire Length Estimates for Digital Design , 2001 .

[17]  Christos Gkantsidis,et al.  The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs , 2003, ALENEX.

[18]  S. Shen-Orr,et al.  Network motifs: simple building blocks of complex networks. , 2002, Science.

[19]  Dirk Stroobandt,et al.  The interpretation and application of Rent's rule , 2000, IEEE Trans. Very Large Scale Integr. Syst..

[20]  Jason Cong,et al.  Optimality and scalability study of existing placement algorithms , 2003, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.