Superfamilies of Evolved and Designed Networks

@article{Milo2004SuperfamiliesOE,
  title={Superfamilies of Evolved and Designed Networks},
  author={Ron Milo and Shalev Itzkovitz and Nadav Kashtan and Reuven Levitt and Shai Shen-Orr and Inbal Ayzenshtat and Michal Sheffer and Uri Alon},
  journal={Science},
  year={2004},
  volume={303},
  pages={1538 - 1542}
}
Complex biological, technological, and sociological networks can be of very different sizes and connectivities, making it difficult to compare their structures. Here we present an approach to systematically study similarity in the local structure of networks, based on the significance profile (SP) of small subgraphs in the network compared to randomized networks. We find several superfamilies of previously unrelated networks with very similar SPs. One superfamily, including transcription… Expand

Topics from this paper

Algorithmic complexity of motifs clusters superfamilies of networks
  • H. Zenil, N. Kiani, J. Tegnér
  • Computer Science, Mathematics
  • 2013 IEEE International Conference on Bioinformatics and Biomedicine
  • 2013
TLDR
It is reported that using numerical approximations of Kolmogorov complexity, by means of algorithmic probability, clusters different classes of networks. Expand
Characterizing Motifs in Weighted Complex Networks
The local structure of unweighted complex networks can be characterized by the occurrence frequencies of subgraphs in the network. Frequently occurring subgraphs, motifs, have been related to theExpand
Cliques and duplication-divergence network growth.
TLDR
A population of complete subgraphs or cliques in a protein network model is studied and a clique population distribution is derived, which scales linearly with the size of the network and is in a perfect agreement with numerical simulations. Expand
Structural distance and evolutionary relationship of networks
TLDR
A measure to quantify the structural distance between two networks is useful to elucidate evolutionary relationships and is well captured in the findings that support the other cladistic results based on gene content and ribosomal RNA sequences. Expand
Exploring biological network structure with clustered random networks
TLDR
A new Markov chain simulation algorithm is developed and implemented to generate simple, connected random graphs that have a specified degree sequence and level of clustering, but are random in all other respects, allowing for systematic study of the impacts of connectivity and redundancies on network function and dynamics. Expand
Randomization and Feedback Properties of Directed Graphs Inspired by Gene Networks
TLDR
A graph decimation algorithm, called “leaf-removal”, which can be used to evaluate the feedback in a random graph ensemble is reviewed, and the possibility of analyzing networks where the diagonal of the adjacency matrix is structured, that is, has a fixed number of nonzero entries is considered. Expand
A network model with structured nodes
  • P. Frisco
  • Mathematics, Computer Science
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2011
We present a network model in which words over a specific alphabet, called structures, are associated to each node and undirected edges are added depending on some distance measure between differentExpand
Biological network motif detection: principles and practice
TLDR
The biological significance of network motifs, the motivation behind solving the motif-finding problem, and strategies to solve the various aspects of this problem are discussed. Expand
How random are complex networks
TLDR
This work considers six real networks and finds that many important local and global structural properties of these networks are closely reproduced by $dk$-random graphs whose degree distributions, degree correlations, and clustering are as in the corresponding real network. Expand
Geometric origins of self-similarity in the evolution of real networks
TLDR
The Geometric Branching Growth model is presented, which is designed to predict evolution and explain the symmetries observed and produces multiscale unfolding of a network in a sequence of scaled-up replicas. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 68 REFERENCES
Network motifs: simple building blocks of complex networks.
TLDR
Network motifs, patterns of interconnections occurring in complex networks at numbers that are significantly higher than those in randomized networks, are defined and may define universal classes of networks. Expand
Emergence of scaling in random networks
TLDR
A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems. Expand
Specificity and Stability in Topology of Protein Networks
TLDR
It is found that for both interaction and regulatory networks, links between highly connected proteins are systematically suppressed, whereas those between a highly connected and low-connected pairs of proteins are favored. Expand
Classification of scale-free networks
TLDR
It is shown that the betweenness centrality displays a power-law distribution with an exponent η, which is robust, and is used to classify the scale-free networks, including two universality classes with η ≈ 2.2(1) and 2.0, respectively. Expand
The Structure and Function of Complex Networks
  • M. Newman
  • Physics, Computer Science
  • SIAM Rev.
  • 2003
TLDR
Developments in this field are reviewed, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks. Expand
Correlated random networks.
TLDR
More general interactions H(c) are studied which lead to correlations, for example, between the connectivities of adjacent vertices which are argued to be a crucial signature of evolutionary design in biological networks. Expand
Collective dynamics of ‘small-world’ networks
TLDR
Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs. Expand
Network motifs in the transcriptional regulation network of Escherichia coli
TLDR
This work applied new algorithms for systematically detecting network motifs to one of the best-characterized regulation networks, that of direct transcriptional interactions in Escherichia coli, and finds that much of the network is composed of repeated appearances of three highly significant motifs. Expand
Exploring complex networks
TLDR
This work aims to understand how an enormous network of interacting dynamical systems — be they neurons, power stations or lasers — will behave collectively, given their individual dynamics and coupling architecture. Expand
Structure and function of the feed-forward loop network motif
  • S. Mangan, U. Alon
  • Biology, Medicine
  • Proceedings of the National Academy of Sciences of the United States of America
  • 2003
TLDR
This study defines the function of one of the most significant recurring circuit elements in transcription networks, the feed-forward loop (FFL), which is a three-gene pattern composed of two input transcription factors, both jointly regulating a target gene. Expand
...
1
2
3
4
5
...