A wire length estimation technique utilizing neighborhood density equations
DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
Multilevel k-way hypergraph partitioning
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
The interpretation and application of Rent's rule
IEEE Transactions on Very Large Scale Integration (VLSI) Systems - Special issue on system-level interconnect prediction
Wirelength estimation based on rent exponents of partitioning and placement
Proceedings of the 2001 international workshop on System-level interconnect prediction
A-priori wirelength and interconnect estimation based on circuit characteristics
Proceedings of the 2003 international workshop on System-level interconnect prediction
Pre-layout wire length and congestion estimation
Proceedings of the 41st annual Design Automation Conference
Toward the accurate prediction of placement wire length distributions in VLSI circuits
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Intrinsic shortest path length: a new, accurate a priori wirelength estimator
ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
Systems Biology: Properties of Reconstructed Networks
Systems Biology: Properties of Reconstructed Networks
On a Pin Versus Block Relationship For Partitions of Logic Graphs
IEEE Transactions on Computers
Efficient and simple generation of random simple connected graphs with prescribed degree sequence
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Optimality and scalability study of existing placement algorithms
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
On two-layer brain-inspired hierarchical topologies – a rent's rule approach –
Transactions on High-Performance Embedded Architectures and Compilers IV
| Hi-index | 0.00 |
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.