The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Network Inference, Analysis, and Modeling in Systems Biology
Open accessAbstract
Cells use signaling and regulatory pathways connecting numerous constituents, such as DNA, RNA, proteins, and small molecules, to coordinate multiple functions, allowing them to adapt to changing environments. High-throughput experimental methods enable the measurement of expression levels for thousands of genes and the determination of thousands of protein–protein or protein–DNA interactions. It is increasingly recognized that theoretical methods, such as statistical inference, graph analysis, and dynamic modeling, are needed to make sense of this abundance of information. This perspective argues that theoretical methods and models are most useful if they lead to novel biological predictions and reviews biological predictions arising from three systems biology topics: graph inference (i.e., reconstructing the network of interactions among a set of biological entities), graph analysis (i.e., mining the information content of the network), and dynamic network modeling (i.e., connecting the interaction network to the dynamic behavior of the system). The methods and principles discussed in this perspective are generally applicable, and the examples were selected from plant biology wherever possible. To understand the function of a cell or of higher units of biological organization, often it is beneficial to conceptualize them as systems of interacting elements. For such a systems-level description (which represents the main goal of systems biology), one needs to know (1) the identity of the components that constitute the biological system; (2) the dynamic behavior of these components (i.e., how their abundance or activity changes over time in various conditions); and (3) the interactions among these components (Kitano, 2002). Ultimately, this information can be combined into a model that is not only consistent with current knowledge but provides new insights and predictions, such as the behavior of the system in conditions that were previously unexplored. The origins of systems biology can be traced back to systems theory, a line of inquiry based on the assumptions that all phenomena can be viewed as a web of relationships among elements, and all systems can be handled by a common set of methods (von Bertalanffy, 1968; Weinberg, 1975; Bogdanov, 1980; Heinrich and Schuster, 1996; Francois, 1999; Voit, 2000). Early attempts at systems-level understanding of biology suffered from inadequate data on which to base the theories and models; however, the recent advent of high-throughput technologies brought an abundance of data on system elements and interactions, leading to a revival of systems biology. Hypothetical Network Illustrating Network Analysis and Dynamic Modeling Terminology. (A) The interaction graph formed by nodes A to F consists of directed edges signifying positive regulation (denoted by terminal arrows), such as AB and ED, directed edges signifying negative regulation (denoted by terminal filled circles), such as FE and autoinhibitory (decay) edges (denoted by terminal filled circles) at nodes B to F. The graph contains one feed-forward loop (ABC; both A and B feed into C) and one negative feedback loop, EDF, which also forms the graph's strongly connected subgraph. The in-cluster of this subgraph contains the nodes A and B, while its out-cluster is the node C. (B) The node in-degrees (kin) that quantify the number of edges that end in a given node range between 0 (for node A) and 4 (for node C). The node out-degrees (kout), quantifying the number of edges that start at a given node, range between 1 (for C) and 3 (for B and E). The graph distance (d) between two nodes is defined as the number of edges in the shortest path between them. For example, the distance between nodes E and D is one, the distance between nodes D and E is two (along the DFE path), and the distance between nodes C and A is infinite because no path starting from C and ending in A exists. The betweenness centrality (b) of a node quantifies the number of shortest paths in which the node is an intermediary (not beginning or end) node. For example, the betweenness centrality of node A is zero because it is not contained in any shortest paths that do not start or end in A, and the betweenness centrality of node B is three because it is an intermediary in the ABD, ABDF, and ABDFE shortest paths. The in-(out-)degree distribution, [P(kin) and P(kout)] quantifies the fraction of nodes with in-degree kin (out-degree kout). For example, one node (C) has an out-degree of one; two nodes (E and F) have an out-degree of two and three nodes (A, B, and D) have an out-degree of three; the corresponding fractions are obtained by dividing by the total number of nodes (six). The distance distribution P(d) denotes the fraction of node pairs having the distance d. The betweenness centrality distribution P(b) quantifies the fraction of nodes with betweenness centrality b. (C) Hypothetical time courses for the state of each node in the network (denoted b
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 29,065
Network biology: understanding the cell's functional organization
Barabási, A.-L., & Oltvai, Z. N. (2004) · Nature Reviews Genetics · doi:10.1038/nrg1272 · Cited by 7,903
Transcriptional Regulatory Networks in Saccharomyces cerevisiae
Lee, T. I., Rinaldi, N. J., Robert, F., Odom, D. T., Bar-Joseph, Z., Gerber, G. K., Hannett, N. M., Harbison, C. T., Thompson, C. M., Simon, I., et al. (2002) · Science · doi:10.1126/science.1075090 · Cited by 2,956
The logical analysis of continuous, non-linear biochemical control networks
Glass, L., & Kauffman, S. A. (1973) · Journal of Theoretical Biology · doi:10.1016/0022-5193(73)90208-7 · Cited by 940
Schuldiner, M., Collins, S. R., Thompson, N. J., Denic, V., Bhamidipati, A., Punna, T., Ihmels, J., Andrews, B., Boone, C., Greenblatt, J. F., et al. (2005) · Cell · doi:10.1016/j.cell.2005.08.031 · Cited by 870 · cited 1×
“Most applications derive biological insight through ‘‘guilt by association;’’ that is, they predict the function of unknown gene products by their association with recognized clusters (Schuldiner et al., 2005; Bjorklund et al., 2006).”
BackgroundIntegrating high-throughput and computational data elucidates bacterial networks
Covert, M. W., Knight, E. M., Reed, J. L., Herrgard, M. J., & Palsson, B. O. (2004) · Nature · doi:10.1038/nature02456 · Cited by 792
Yu, J., Smith, V. A., Wang, P. P., Hartemink, A. J., & Jarvis, E. D. (2004) · Bioinformatics · doi:10.1093/bioinformatics/bth448 · Cited by 675
Cited by
Boolean modeling in systems biology: an overview of methodology and applications
Wang, R.-S., Saadatpour, A., & Albert, R. (2012) · Physical Biology · doi:10.1088/1478-3975/9/5/055001 · Cited by 463
Self-citationShi, R., Sun, Y.-H., Li, Q., Heber, S., Sederoff, R., & Chiang, V. L. (2010) · Plant and Cell Physiology · doi:10.1093/pcp/pcp175 · Cited by 323
Zhao, K., Kumar, A., Harrison, T. P., & Yen, J. (2011) · IEEE Systems Journal · doi:10.1109/jsyst.2010.2100192 · Cited by 314
The Why, How, and When of Representations for Complex Systems
Torres, L., Blevins, A. S., Bassett, D., & Eliassi-Rad, T. (2021) · SIAM Review · doi:10.1137/20m1355896 · Cited by 297
Methods for biological data integration: perspectives and challenges
Gligorijević, V., & Pržulj, N. (2015) · Journal of The Royal Society Interface · doi:10.1098/rsif.2015.0571 · Cited by 275
Metadata
- Authors
- Albert, R.
- Venue
- The Plant Cell
- Publisher
- Oxford University Press (OUP)
- Published
- 2007-11
- Volume
- 19
- Issue
- 11
- Pages
- 3327-3338
- ISSN
- 1040-4651 (ISSN-L)
- 1532-298X
- OpenAlex
- W2120526231
- Cited by
- 179
- References
- 7
- FWCI
- 3.59
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Network Inference, Analysis, and Modeling in Systems Biology. https://app.cochat.ai/papers/10.1105/tpc.107.054700
- The paper
- Albert, R. (2007). Network Inference, Analysis, and Modeling in Systems Biology. The Plant Cell. https://doi.org/10.1105/tpc.107.054700
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.