Skip to main content
Frontiers in Bioinformatics logoLink to Frontiers in Bioinformatics
. 2026 May 12;6:1822526. doi: 10.3389/fbinf.2026.1822526

Temporal network analysis in systems biology: concepts, inference, and validation

Abir Khazaal 1,2,3, Fatemeh Vafaee 1,2,3,*
PMCID: PMC13200828  PMID: 42199313

Abstract

While network science provides a powerful framework for deciphering complex biological systems, static models often fail to capture the dynamic nature of cellular processes. Temporal network analysis addresses this by modelling biological relationships as time-indexed graphs, offering a more realistic representation of evolving biological interactions. But, biological data are often sparse, noisy, and heterogeneous, making temporal network reconstruction highly sensitive to modelling and preprocessing choices. This review synthesises temporal network analysis for systems biology with an emphasis on practical interpretability and trustworthy inference. We highlight how different notions of “time” (e.g., longitudinal measurements, condition/stage progression, or inferred trajectories) and different meanings of “edges” (e.g., physical interactions, statistical associations, or model-based influences) support different biological claims and therefore demand different validation strategies. Using a multi-scale perspective, we survey approaches for characterising local dynamics, tracking mesoscale reorganisation such as module and community changes, and quantifying global shifts in network topology, alongside common tasks including rewiring detection, network comparison, and community evolution. A central message is that inference is often the bottleneck, while prediction is the temptation. We therefore foreground validation and benchmarking practices needed to distinguish genuine biological dynamics from artefacts of sampling, windowing, or model class. Finally, we discuss temporal graph learning, including temporal graph neural networks. We highlight when these methods can enable meaningful forecasting in biology, and when performance is inflated by sensitivity to network construction choices or information leakage in evaluation.

Keywords: AI-predictive modelling, community detection, dynamic networks, network inference, systems biology, temporal network analysis

1. Introduction

Biological systems are dynamic in ways that matter mechanistically: regulatory influences switch on and off, interaction strengths shift, and causal influence depends on when events occur. Network-based models provide a powerful abstraction for representing these systems, where nodes denote biological entities and edges encode relationships between them (Kulandaisamy et al., 2017; Nooren and Thornton, 2003; Liu et al., 2020). Yet many biological networks are still analysed as static graphs, implicitly assuming that edges are time-invariant (Bornholdt and Schuster, 2001; Newman, 2018; Newman, 2001). When time is collapsed into a single aggregate network, analyses can miss transient interactions, distort time-respecting (causally plausible) paths, and blur temporal ordering that is essential for mechanistic interpretation (Holme and Saramäki, 2012; Wu et al., 2014; Masuda et al., 2013; Li et al., 2017).

Temporal network analysis addresses this limitation by representing networks as sequences of snapshots or time-stamped interaction events, enabling the study of network evolution, temporally constrained reachability, and dynamic reconfiguration (Holme and Saramäki, 2012; Li et al., 2017; Masuda and Lambiotte, 2016; Holme, 2015). However, in biological contexts, temporal resolution is often suboptimal: sampling is sparse, destructive (particularly in single-cell assays), and heterogeneous across modalities (Greenfield et al., 2010; Palsson, 2011; Alali and Imani, 2022). This leads to a high risk of temporal aliasing, as critical short-lived events occur between sampling points. As a result, multiple incompatible temporal networks can appear plausible unless inference choices and evaluation design are treated as first-class modelling decisions (Sun and Wang, 2019; Degirmenci et al., 2020; Blonder et al., 2012; Šverko et al., 2022; Zhong et al., 2021).

This review is organised around a practical thesis: Inference is the bottleneck; prediction is the temptation. In biology, the hardest step is often not computing temporal metrics, but inferring a biologically faithful temporal network from noisy, high-dimensional, and temporally sparse measurements (Aalto et al., 2020; Pratapa et al., 2020). The field has therefore invested heavily in inference strategies that compensate for sparse sampling, including statistical enhancement (Stegle et al., 2010; Campbell and Yau, 2016; Äijö et al., 2018; Märtens et al., 2019; Newaz and Milenković, 2020; Yu et al., 2017), multi-omics integration and incorporation of prior knowledge (Subramanian et al., 2020; Sanches et al., 2024; Conard et al., 2021; Marku and Pancaldi, 2023; Liu et al., 2017; Duren et al., 2020; Stock et al., 2025; Padi and Quackenbush, 2015; Ideker et al., 2011), and model-based approaches that explicitly encode mechanistic assumptions (Mercatelli et al., 2020; Lopatkin and Collins, 2020; Ajmal and Madden, 2023; Cheng et al., 2024; Hsu and Chen, 2022; Friedman et al., 2000). However, as inference pipelines grow more complex, so does the need for validation and benchmarking: without careful checks, different window choices, priors, or model classes can produce incompatible “explanations” from the same dataset (Šverko et al., 2022; Hulovatyy et al., 2015; Caceres and Fish, 2017; Mei et al., 2025; Gauvin et al., 2022).

Recent syntheses have surveyed graph learning across single-cell omics tasks, emphasising model families and application areas, and highlighting how graph construction choices affect downstream performance (e.g., cell-cell vs. gene-gene graphs) (Li et al., 2025; Hetzel et al., 2021). In parallel, emerging work has advanced temporal inference by reconstructing trajectories under destructive sampling, for example, using optimal-transport frameworks like OTVelo, for time-stamped single-cell expression data (scRNAseq) (Zhao et al., 2025). Furthermore, new benchmark efforts such as CausalBench have made evaluation more realistic by leveraging large-scale perturbation data (Chevalley et al., 2025). What is still missing is a unified, practical framing that connects (i) what “time” and “edges” mean, (ii) how inference choices shape the network object, and (iii) how validation and leakage-safe evaluation determine which temporal stories are trustworthy. Here, we provide that bridge by treating inference and evaluation as design problems that must be settled before prediction claims can be taken seriously.

To keep the review concrete and usable, we introduce two short decision Boxes early on. Box 1 distinguishes three meanings of “time” in biological network studies: clock time, condition/stage, and pseudotime; these are frequently conflated but imply different modelling assumptions and validation strategies (Ding et al., 2022; Tritschler et al., 2019; Husmeier, 2003). Box 2 defines edge semantics because the meaning of “rewiring” depends on whether edges encode physical interactions, statistical association, or inferred influence (Li et al., 2018; Zitnik et al., 2024; Oates and Mukherjee, 2012). With these foundations in place, we adopt a multi-scale perspective, examining temporal networks at the micro-scale (nodes and edges), meso-scale (substructures and communities), and macro-scale (global topology), followed by core analytical tasks and field-wide challenges. Finally, we add a dedicated validation and benchmarking section to operationalise the thesis above; inference must be made trustworthy before prediction claims can be taken seriously. Figure 1 provides an end-to-end roadmap of temporal network analysis in systems biology, from selecting a time regime and defining edge semantics to representation and inference choices. It also highlights validation and benchmarking as a quality-control gate and frames predictive modelling as appropriate only after leakage-safe evaluation and robustness checks.

Box 1. “Time” in biological networks: three regimes with different assumptions.

A recurring source of confusion in temporal network biology is that “time” can mean at least three different things. These regimes are not interchangeable; each supports different network constructions, causal claims, and validation strategies.

  1. Clock time (longitudinal time): measurements taken at known times (minutes/hours/days). This regime most directly supports temporal windows and time-respecting paths, and is essential for modelling fast signalling kinetics or time-ordered propagation. However, biological longitudinal sampling is often sparse or irregular due to experimental constraints, creating a high risk of temporal aliasing (missing transient events between samples). Window choice becomes a major modelling decision: too short yields fragmented graphs; too long averages away transient biology (Rajaguru et al., 2025; Sherwani et al., 2025; Chiappori and Cazabet, 2021; Gelardi et al., 2021).

  2. Condition/stage as a proxy for time: networks indexed by disease stage, treatment phase, or developmental stage (e.g., “early vs. late”, “pre vs. post”). This is often closer to an evolving network representation: a sequence of snapshots whose spacing is not necessarily uniform. It enables useful comparative analyses (rewiring, module changes, shifting hubs) even when absolute timing is unknown, but causal interpretation must be cautious because stage labels compress heterogeneous trajectories (Upadhyaya et al., 2020; Galindez et al., 2023; Mitra et al., 2024).

  3. Pseudotime (inferred latent time from snapshots): common in single-cell biology, where cells are sampled once but ordered along a trajectory. Pseudotime can create a time-like axis for network analysis, but it is model-dependent and must be treated as an inference output with uncertainty, not as ground-truth time. In practice, pseudotime is valuable for reconstructing continuous trajectories from sparse observations and can be paired with probabilistic models to propagate uncertainty into downstream analyses (Tritschler et al., 2019; Song and Li, 2021; Fang et al., 2025; Hou et al., 2023; Husmeier, 2003).

Box 2. Edge semantics: functional definitions and dynamics.

A temporal network analysis is only interpretable if the edge semantics are explicit (what an edge represents biologically and how it is estimated).

  1. Physical interaction edges: Edges represent direct molecular interaction (e.g., protein binding in protein-protein interaction networks (PPIs). Here, an edge changing over time can plausibly indicate condition-specific complex assembly, signalling complex transitions, or context-dependent binding (Wu et al., 2024; Akbarzadeh et al., 2024; Stacey et al., 2018; Greenblatt et al., 2024). Validation can be supported by orthogonal assays or established interactome databases.

  2. Statistical association edges: Edges represent correlation/association (e.g., co-expression) inferred from measurements. Temporal changes then reflect shifting covariance structure, which can be biologically meaningful but is not itself causality. These edges are highly sensitive to sampling density, window choice, and noise, so stability checks and null models become essential (Van Dam et al., 2018; Lau et al., 2020; Masuda et al., 2025; Yu, 2018).

  3. Regulatory influence edges (model-based): Edges represent inferred influence (often directed) from model classes such as Bayesian networks, Boolean networks, ODE/state-space models, or optimisation-based inference. In this regime, an edge implies a conditional dependency or dynamical coupling under assumptions, not necessarily a directly observed interaction (Pratapa et al., 2020; Marku and Pancaldi, 2023; Bravo González-Blas et al., 2023). This is especially relevant for GRN inference from time-series transcriptomics and integrated multi-omics data (Li et al., 2024; Yuan and Duren, 2025).

FIGURE 1.

Diagram illustrating six key components of temporal network analysis: 1. Study design and time regime, 2. Edge semantics, 3. Representation choice, 4. Inference strategies, 5. Validation and benchmarking, and 6. Downstream analysis, with each section accompanied by brief descriptions and relevant network illustrations. Arrows connect each component to a central hexagon labeled "Temporal Network Analysis."

An end-to-end roadmap for temporal network analysis in systems biology. The schematic summarises the main decision points and workflow stages covered in this review. (1) Study design and time regime define what “time” represents (clock time, condition/stage, or pseudotime). (2) Edge semantics specifies what an edge means biologically (physical interactions such as protein-protein interaction networks (PPIs), statistical association such as co-expression, or inferred regulatory influence such as gene regulatory networks (GRNs), including whether edges are directed/undirected and weighted/unweighted. (3) Representation choice maps data to a temporal object (event streams, discrete snapshots, sliding windows, or multilayer coupling). (4) Inference strategies illustrate common approaches for reconstructing temporal structure from sparse/noisy measurements, including statistical enhancement (e.g., Gaussian process interpolation), incorporating prior knowledge and multi-omics constraints, and model-based formulations (e.g., Bayesian networks and ordinary differential equations (ODEs). (5) Validation and benchmarking are positioned as a quality-control (QC) gate, highlighting sensitivity analysis, uncertainty/stability quantification, temporal null models, and external/orthogonal evidence. (6) Downstream analysis spans micro-, meso-, and macro-scale characterisation (node/edge dynamics, substructures such as motifs/communities, and global topology), with predictive modelling (e.g., temporal graph neural networks) explicitly shown as appropriate only after robustness checks and leakage-safe evaluation.

Practical implication: before building a “temporal network,” state explicitly which regime you are in. Clock time supports time-respecting paths and temporal causality; condition/stage supports snapshot comparisons and slower “evolution” narratives; pseudotime supports trajectory-aware analyses but demands uncertainty-aware validation. Throughout this review, we use “temporal network” for explicitly time-indexed interactions and “evolving network” for slower snapshot sequences, while recognising that biological studies often blend these terms.

2. From measurements to temporal graphs: representations and assumptions

As summarised in Figure 1, temporal conclusions often depend more on upstream design and inference decisions than on downstream metrics; we therefore make these construction choices explicit before surveying analysis methods. After defining “time” in the network, the next step is to make the network representation equally explicit, because temporal conclusions often depend more on construction choices than on the downstream metric.

2.1. Terminology quick map

In the literature, closely related ideas are labelled inconsistently (Holme and Saramäki, 2012; Masuda and Lambiotte, 2016; Rossi et al., 2013; Casteigts et al., 2012). We therefore use three terms with specific meanings to avoid ambiguity:

  • Dynamic Network: umbrella term for any network whose topology or properties change over time.

  • Temporal Network: interactions represented as discrete, time-stamped events (event sequence), enabling time-respecting paths and event-level ordering (Li et al., 2017; Holme, 2015).

  • Evolving Network: slower structural change is typically analysed as a series of snapshot graphs, often widely spaced (e.g., disease stages or longitudinal sampling points) (Albert and Barabási, 2000; Yook et al., 2001; Xu and Hero, 2013).

2.2. From measurements to graphs

Given a time regime, biological data are typically mapped into one of four analysable objects (Figure 2): (i) an event stream (time-stamped interactions), (ii) a sequence of discrete snapshots (one graph per time point/condition), (iii) sliding-window snapshots (overlapping windows that smooth estimates), or (iv) an explicitly coupled multilayer model (within-layer edges plus between-layer coupling) (Li et al., 2017; Hulovatyy et al., 2015; Boccaletti et al., 2006; Moctar et al., 2019; Kivelä et al., 2014). In snapshot-based settings, the temporal window is the key knob, with overly short windows yielding sparse, fragmented graphs. In contrast, overly long windows may average away transient biology and create “rewiring” artefacts (Blonder et al., 2012; Sulo et al., 2010; Caceres et al., 2011). Because window choice is process-dependent, authors should justify it using the time scale of the phenomenon (minutes for signalling, hours/days for differentiation and months/years for progression), and, when possible, report sensitivity of conclusions to reasonable alternatives (Mittnenzweig et al., 2021; Blazek et al., 2015; Ahmad et al., 2019; Mayran et al., 2018). These choices define the temporal dynamics of the biological network and provide an explicit framework for mapping observations onto graph objects.

FIGURE 2.

Diagram showing four methods for representing temporal networks using colored nodes labeled A (blue), B (red), C (green), and D (yellow). Panel A illustrates an event stream with interactions across time points T1 to T5. Panel B displays snapshots as separate network graphs at times T1 through T6, showing which nodes are connected at each time. Panel C presents sliding window graphs, combining events from T1-T2 or T3-T4 into aggregate network views. Panel D demonstrates multilayer coupling, linking node instances across three time points in overlapping network planes.

Mapping biological measurements to temporal graph objects. Four common representations are used to encode temporal information in biological networks, and each preserves different aspects of temporal structure for downstream analysis. (A) Event stream: interactions are represented as time-stamped events, preserving event order and enabling time-respecting paths. (B) Discrete snapshots: one graph per time point or condition (e.g., T1–T6), enabling comparison of topology and metrics across states. (C) Sliding windows: overlapping windows aggregate events/measurements within each window to produce a smoother sequence of graphs, at the cost of introducing a window-size hyperparameter. (D) Multilayer coupling: a stack of time-indexed layers with within-layer edges and explicit inter-layer coupling linking nodes across adjacent times, supporting temporally regularised inference and community tracking.

A second, equally consequential modelling choice is the biological definition and estimation of network edges. The significance of “rewiring” is fundamentally tied to the nature of the connection (be it a physical interaction, statistical dependency, or directed influence) (Marku and Pancaldi, 2023; Cho et al., 2004; Safari-Alighiarloo et al., 2014; Koh et al., 2012; Quach et al., 2007). We provide a taxonomy of these edge semantics in Box 2.

Regardless of the specific edge semantics, temporal dynamics typically manifest through four primary modalities: (i) topological alterations (presence/absence), (ii) fluctuations in edge weight or strength, (iii) shifts in directionality, and (iv) changes in the effective lag or temporal order (Holme and Saramäki, 2012; Masuda and Lambiotte, 2016; Gauvin et al., 2022; Masuda et al., 2021). Consequently, the interpretation of network ‘rewiring’ is not universal; any such claim must be contextualized within the chosen edge regime (physical, statistical, or model-based) to ensure that biological conclusions and validation strategies remain consistent with the underlying data representation.

In summary, formalising the temporal regime and edge semantics provides the necessary guardrails for meaningful analysis, ensuring that observed dynamics reflect biology rather than modelling artifacts. As we have argued, solving this ‘upstream’ bottleneck of inference is a prerequisite for any trustworthy prediction. Table 1 summarises the minimum reporting items required to make temporal network results comparable and leakage-resistant across studies. Once these construction choices are stabilised and validated, the focus can shift from the mechanics of the network to its functional architecture. In the following section, we examine how these temporal characteristics manifest across biological scales.

TABLE 1.

Minimum reporting checklist for biological temporal network studies. Items reflect common failure modes in temporal inference and evaluation (e.g., sensitivity to windowing, uncertainty in inferred time, and information leakage in prediction) and align reporting with time regime and edge semantics.

Time regime Define whether “time” is clock time, condition/stage, or pseudotime; if pseudotime is used, describe the inference method and how ordering uncertainty is handled
Edge semantics State what an edge represents (physical interaction, statistical association, or inferred influence); specify whether edges are directed/undirected and how weights are defined
Graph construction Describe the mapping from measurements to graphs (event definition or windowing rule); report filtering/thresholding or regularisation; specify how missingness and batch/technical effects were handled
Inference method Name the model class and key hyperparameters; describe priors/constraints (e.g., multi-omics or curated knowledge) and how they enter the inference
Stability/Sensitivity Re-run inference under at least two reasonable alternatives (e.g., window sizes or smoothing strengths) and report stability summaries (edge overlap, hub rank consistency, module persistence)
Null model Specify the temporal null model used (what temporal statistics are preserved vs. randomised) and what hypothesis it tests
External evidence Report supporting evidence where available (enrichment against known PPIs/TF binding, agreement with orthogonal omics, or perturbation support)
Prediction evaluation Define the prediction task; use an explicit temporal split; apply subject-/sample-level separation when relevant; document leakage checks and negative sampling choices for temporal link prediction

Complementing Table 1, we distil these reporting principles into a practical decision guide for common biological data settings (Figure 3), linking the type of temporal information available to the corresponding graph representation, sensible first analytical tasks, and the main inferential cautions that should be addressed before biological claims are made.

FIGURE 3.

Flowchart outlining strategies for temporal network analysis based on data types: event-resolved, bulk measurements, single-cell snapshots, and paired multi-omics. Each column details representations, initial tasks, and main cautions. Guidance begins with identifying time regime and ends with standardized validation recommendations involving sensitivity testing, stability quantification, and precautions for temporal data analysis.

Practical decision guide for temporal network analysis in systems biology. This schematic provides a pragmatic framework for aligning common biological data settings with appropriate temporal network representations, initial analytical tasks, and key inferential cautions. The guide begins by asking the researcher to identify the time regime, the observed data type, and the intended edge meaning before selecting a downstream analytical strategy. Four common starting points are distinguished: clock-time or event-resolved data, repeated bulk measurements or stage-specific cohorts, single-cell snapshots with latent progression, and paired temporal multi-omics data. For each setting, the figure indicates a suitable representation of temporal structure, including event streams, snapshot or multilayer networks, trajectory-aligned or pseudotime-indexed gene regulatory networks, and constrained temporal regulatory networks informed by cross-modal priors. It also highlights sensible first analyses, such as time-respecting paths, temporal centrality, rewiring or differential analysis, network comparison, community evolution, candidate regulator prioritisation, state-transition analysis, directionality checks, and cross-modal consistency assessment. The lower panel emphasises that, irrespective of data type, temporal conclusions should be supported by validation and benchmarking steps, including sensitivity analyses, stability assessment by subsampling or bootstrap, comparison with temporal null models, external or orthogonal support where available, and leakage-safe temporal splits before prediction. The guide is intended to be practical rather than exhaustive and reinforces the central argument of this review: in temporal biology, method choice must remain consistent with the meaning of time, the meaning of edges, and the validation strategy used to support biological claims.

3. Characteristics of temporal networks across scales

Having defined the core terminology and the two decision points: what “time” represents and what an “edge” means, we now turn to analysis methods for temporal networks (TNs) in biology. In practice, many biological studies represent time as a sequence of snapshot graphs (what we call evolving networks in Section 2.1), so throughout Sections 3–5, we use “TNs” as a shorthand that includes both event-stream temporal networks and snapshot-based evolving networks unless stated otherwise. We adopt a multi-scale perspective: micro-scale measures describe node and edge dynamics, meso-scale approaches capture evolving substructures and communities, and macro-scale metrics summarise global topology and stability. We begin our exploration at the most granular level: the micro-scale.

3.1. Micro-scale (local patterns)

At the micro-scale, analysis focuses on the properties of individual nodes and edges, revealing the changing roles of key biological entities over time.

3.1.1. Nodes

Node importance is often assessed using metrics like degree (number of connections) and betweenness centrality (influence over paths through the network). These centrality metrics can highlight influential “hubs”, whose biological significance is highlighted via the “centrality-lethality” observation in PPI networks (Jeong et al., 2001; He and Zhang, 2006). However, hub-essentiality patterns are context- and assay-dependent; in temporal settings, centrality is therefore most useful for identifying transient control points rather than universal hubs. Moreover, direct comparisons across networks are often confounded because changes in network size and density can shift centrality baselines even without biological rewiring (Zhong et al., 2022; Yu et al., 2020). In practice, robust comparison of node importance across time often benefits from normalisation or stability checks (e.g., rank-based comparisons across snapshots, and sensitivity to thresholding/resampling choices). Formal definitions of these foundational metrics are provided in Supplementary File S1, Section A.

In TNs, these measures adapt to account for time ordering. For instance, temporal betweenness centrality considers only time-respecting paths where interactions occur in a chronological order (Tsalouchidou et al., 2020; Zaoli et al., 2021), which is critical for modelling processes like disease transmission or signalling cascades (Machens et al., 2013; Husein et al., 2019). Such temporal metrics can reveal nodes that become transiently influential. In studies of cell differentiation, temporal degree centrality has been used to identify transcription factors that become hubs only at specific developmental stages (Xie et al., 2020). Similarly, in pancreatic ductal adenocarcinoma (PDAC), temporal centrality analysis identified distinct sets of key genes driving network stability at early (e.g., NDC80, KIF2C) versus advanced (e.g., ITGA4, ITGB4) stages of cancer progression (Pan et al., 2018); insights that would be missed in a static analysis.

3.1.2. Edges

Edges in TNs represent dynamic interactions whose existence, strength (weight), and directionality can change over time. Examining these shifts can help characterise regulatory changes during biological transitions, such as immune responses or cell differentiation (Hugues et al., 2004; Sheu and Hoffmann, 2022). For instance, in GRNs, interactions emerge or vanish depending on developmental stage or environmental conditions, governing gene activation and suppression (Erwin and Davidson, 2009). Edge weights may reflect interaction intensity, like protein binding affinity or synaptic strength, that fluctuates in response to stimuli or disease progression (Lu et al., 2007). Directionality is also critical because it enables time-respecting paths, supporting models of signalling cascades or hierarchical regulation of gene expression by master regulators (Chan and Kyba, 2013; Van Der Wijst et al., 2018). Importantly, in omics-derived networks, apparent edge gain/loss is often driven by sampling, preprocessing, and inference choices; edge-level uncertainty and robustness should be assessed (and ideally reported) before interpreting rewiring as biology. A more detailed discussion of edge dynamics, including case studies on context-dependent transcription factor binding, intermittent gene co-expression, and synaptic plasticity, is provided in Supplementary File S1, Section B.

3.2. Meso-scale (substructures: from building blocks to functional modules)

Zooming out from individual nodes and edges, meso-scale level analysis examines subgroups of nodes whose organisation reflects intermediate-level architecture and function. Depending on the analytical questions, these substructures range from small, recurring patterns (motifs or graphlets) to maximally interconnected sets (cliques) and cohesive modules (communities). Supplementary Table S1 summarises key meso-scale substructure types, and Supplementary File S2 provides a more detailed review of formal definitions and distinctions between subgraphs, graphlets, motifs, and cliques, with a visual presentation in Supplementary Figure S2.

3.2.1. Communities: bridging structure and function at a larger scale

In biological networks, rigid patterns such as motifs and cliques are often too restrictive to capture system-level organisation. Many networks instead exhibit modularity, motivating community/module discovery as a coarse-grained description of functional organisation (Arenas et al., 2008). In graph-theoretic terms, a community is not merely any subgraph, but a set of nodes whose internal connectivity is denser than expected under an appropriate null model (Supplementary Figure S3) (Radicchi et al., 2004; Porter et al., 2009; Fortunato, 2010). Numerous algorithms operationalise this idea (Coscia et al., 2011; Li et al., 2010; Ni et al., 2019), including modularity-maximising approaches that partition networks to maximise the difference between observed and expected within-community connections (Newman and Girvan, 2004; Newman, 2006; Alcalá-Corona et al., 2021). In complex disease contexts, community detection can help localise coordinated perturbations spanning multiple interacting genes or proteins, supporting mechanistic interpretation and therapeutic hypothesis generation (Sevimoglu and Arga, 2014; Valentini et al., 2014; Manipur et al., 2021).

3.2.2. Meso-scale structures in TNs

The dynamic nature of real-world networks adds complexity at the mesoscale because substructures can emerge, persist or dissolve over time. In biology, temporal data are frequently analysed as snapshots (condition or timepoint-specific networks), enabling direct comparison of meso-scale structure across time (Masuda and Holme, 2019; Hosseinzadeh et al., 2022; Peixoto and Rosvall, 2017). Temporal motif analysis is most informative when interaction timing is resolved at the scale of the mechanism; in many omics-derived TNs, sparse sampling shifts emphasis toward snapshot-based module and community evolution rather than fine-grained event motifs (Kovanen et al., 2011; Liu et al., 2021; D et al., 2014; Lucas et al., 2023). This is a practical limitation rather than a dismissal, as temporal motifs can be highly informative when time-stamped interaction sequences are available, but their interpretability depends strongly on temporal resolution and event completeness.

Instead of enumerating fine-grained event motifs, many biological TN studies focus on persistence vs. transience of meso-scale structure. For example, transient clique-like assemblies can reflect time-ordered formation and disassembly of functional complexes: following stimulation, TNFR1 recruits proteins to form Complex I that drives pro-survival signalling, and subsequent disassembly enables formation of a pro-apoptotic Complex II, illustrating a temporally ordered “appearance/disappearance” of a functional substructure (Yuan and Ofengeim, 2024; Micheau and Tschopp, 2003). Tracking such patterns provides a mechanistic bridge between network dynamics and pathway logic.

At a larger meso-scale, temporal community analysis focuses on events such as community growth/shrinkage and merge/split (“reorganisation”), as well as birth/death (“turnover”) (Figure 4). Complementarily, tracking intermodular vs. intramodular hubs over time can reveal whether regulation is dominated by shifting cross-module coordination or by stability within core complexes (Supplementary Figure S4) (Nooren and Thornton, 2003; Zhang, 2009; Pang et al., 2010), an axis that is often directly interpretable in disease and stress-response settings (Lin et al., 2010).

FIGURE 4.

Diagram showing colored network clusters at two time points, t1 and t2, labeled with processes: splitting, merging, growth, death, birth, merged, split, larger, contraction, and contracted. Arrows indicate changes in cluster structure and connectivity.

Canonical community events in temporal networks. Communities are shown at two time points (t1 and t2); colors indicate community identity across time. Examples of common temporal events include merging (two communities at t1 forming one at t2), splitting (one community at t1 dividing into two at t2), growth and contraction (node gain/loss within a community), and birth/death (appearance/disappearance of a community). These event types provide a shared vocabulary for reporting community evolution in biological temporal networks.

3.2.3. Models for mesoscale dynamics: Markovian, higher-order, and deep learning

Capturing temporal meso-scale behaviour requires explicit modelling assumptions about how network structure evolves (Li and Maini, 2005). Markov chain models provide a simple baseline in which the state at time t depends only on recent history (first-order) or multiple prior states (higher-order), trading interpretability and statistical efficiency against the ability to represent long-range dependencies (Singer et al., 2014; Chou and D’Orsogna, 2014). However, mesoscale dynamics in biology can reflect nonlinear and delayed effects (e.g., cascades in signalling and regulation), motivating models that can learn richer temporal dependencies.

Recent deep learning approaches on temporal/dynamic graphs, such as temporal graph neural networks and temporal transformers, offer an alternative by learning time-dependent node/edge representations that can be clustered into evolving modules or used to predict future links/states (Kuhn and Oshman, 2011; Kim et al., 2018). These methods can capture complex dependencies beyond fixed-order Markov assumptions, but they introduce additional risks (overfitting, sensitivity to negative sampling/time splits, and reduced interpretability) and therefore require careful validation and reporting.

Across these approaches, comparability hinges on reporting choices that strongly shape meso-scale conclusions. We recommend reporting: (i) snapshot/window definition and effective temporal resolution; (ii) edge inference and filtering choices, including uncertainty/robustness; (iii) community/substructure method and key parameters (including temporal coupling, if used); and (iv) sensitivity of meso-scale results to reasonable alternatives (e.g., resampling, thresholds, and at least one methodologically distinct baseline).

3.3. Macro-scale (global properties)

While micro-scale and meso-scale analyses focus on individual components and modules, a macro-scale perspective is essential for understanding the global properties that govern the entire network’s stability, efficiency and robustness (Palazzi Nieves et al., 2019).

Classic static properties such as network density, degree distribution, clustering coefficient, modularity, and average path length provide a vocabulary for describing a network’s architecture. These measures are crucial for characterising network topology, identifying structural properties like scale-free or small-world characteristics, and quantifying functional organisation. Foundational definitions of these metrics and a visual guide are provided in Supplementary File S3 and Supplementary Figure S5.

Applying macro-scale analysis to TNs allows us to address system-level questions about how stability, resilience, and efficiency change over time. Tracking such global properties is essential for understanding large-scale biological transitions, such as developmental processes or the progression from a healthy to a disease state (Padi and Quackenbush, 2018). For example, a sharp increase in average path length (the mean shortest-path distance between reachable node pairs) over time may indicate the loss or mutation of a hub gene, disrupting network-wide structure, an effect observed in metabolic and PPI networks (Vogelstein et al., 2000; Jeong et al., 2000; Albert and Barabási, 2002). A core challenge is to adapt static metrics for dynamic topologies, and this depends directly on how time is represented (Figure 2). When interactions are available as time-stamped events (event streams), macro-scale descriptors can be defined directly in terms of time-respecting paths and temporal distances (e.g., reachability or temporal efficiency), rather than relying on a static graph that discards ordering (Masuda and Lambiotte, 2016; Holme and Saramäki, 2019).

More commonly in biological studies, time is discretised into a series of snapshots (one graph per time point/condition), and standard metrics are computed independently for each snapshot to generate trajectories that reveal global shifts over time (Holme and Saramäki, 2012; Li et al., 2017). Alternatively, a sliding window technique constructs overlapping subnetworks across successive time windows, which can yield smoother trends but introduces a window-size hyperparameter (Hulovatyy et al., 2015; Moctar et al., 2019). For sparse biological time series networks, it is therefore important to report sensitivity to conclusions to reasonable window choices (Sikdar et al., 2016; Jordan et al., 2020).

A complementary strategy is multilayer coupling, where each time point is treated as a layer, and each node is linked to its counterpart in adjacent layers. This coupling encourages continuity across time (reducing implausibly abrupt shifts caused by noise or sampling) and is widely used for temporally regularised analyses such as tracking communities or modules across layers (Kivelä et al., 2014; Mucha et al., 2010).

In all representations, metrics must be interpreted in a way that respects temporal ordering when the biological question implies ordering or propagation (e.g., signalling and regulatory cascades). However, the extent to which this is possible depends on the graph representation. When data are represented as event streams, temporal shortest paths can be defined as time-respecting paths in which each interaction occurs after the previous one, yielding chronologically plausible routes of propagation (Wu et al., 2014; George and Shekhar, 2008). Similarly, temporal clustering can be formulated in terms of causally ordered triads (triplets of nodes where interactions occur in a causally ordered sequence) or temporally valid closure patterns (Cui et al., 2013; Chen et al., 2024). By contrast, in snapshot and sliding-window representations, these quantities are usually evaluated either within each graph separately or compared across successive graphs, which captures temporal change at a coarser level but does not retain the full event ordering. In multilayer networks, related questions can be addressed by analysing paths, persistence, or community structure across coupled layers. These representation strategies are summarised in Figure 2.

An alternative modelling strategy involves TN aggregation, where a single, cumulative network, also known as a supergraph, is constructed by weighting edges based on their temporal frequency (Holme and Saramäki, 2012; Masuda and Lambiotte, 2016; Braha and Bar-Yam, 2009; Hadlak et al., 2013). While this approach summarises long-term connectivity patterns, it presents limitations (Pfitzner et al., 2013; Scholtes et al., 2016). Aggregation may obscure the timing of specific events, making it difficult to detect intermittent interactions that could be biologically or structurally significant (Cencetti et al., 2021). Furthermore, it treats all interaction frequencies equally, regardless of context (Masuda et al., 2013; Rohrschneider et al., 2010). For instance, two node pairs with identical aggregated edge weights may reflect vastly different dynamics, one arising from repeated weak interactions and the other from a few strong, temporally localised events (Blonder et al., 2012). Without careful interpretation, aggregation may overemphasise noise or underrepresent functionally significant transient events. We treat full aggregation as a baseline that discards ordering and therefore do not include it among the four time-preserving representations in Figure 2.

4. Analytical frontiers and core challenges in TNs

TN analysis is a broad and rapidly evolving field that is inherently complex due to the integration of time-dependent dynamics. Analytical approaches are diverse but generally aim to address a set of core objectives: tracking structural changes, quantifying similarity over time, monitoring the evolution of communities, and ultimately, building predictive models. The choice of approach typically depends on the specific analytical task and the nature of the available data.

4.1. Core analytical tasks

Before addressing the major challenges, it is essential to understand the primary analytical tasks that form the bedrock of TN research.

4.1.1. Tracking structural changes

A core question in TN analysis is how the topology of networks evolves. Researchers investigate local and global structural changes, such as trends in network growth, fragmentation, or rewiring, which involve significant changes in node connections (Fründ, 2021; Sharma et al., 2021). In biological systems, shifts in connectivity may correspond to functional transitions, offering insights into key pathway alterations between physiological states, such as healthy vs. disease (Grimes et al., 2019; Sho and jaie, 2021). For instance, rewiring within cellular molecular networks has been implicated in driving distinct phenotypic outcomes, including embryonic development and cellular differentiation (Boland et al., 2014). To explore such dynamics, snapshot-based analysis is often used, where network metrics like degree distribution and clustering coefficient are calculated at each time point and compared across snapshots (Moctar et al., 2019; Fernex et al., 2021). Other methods include differential network analysis algorithms, which are widely regarded as effective tools for tracking topological changes and identifying recurring patterns (Zhang et al., 2022; Lichtblau et al., 2017). In parallel multilayer network models enable the study of both intra-layer edges (within a time point) and inter-layer edges (across time points) (Kivelä et al., 2014).

4.1.2. Quantifying network similarity

Comparing and quantifying the similarity between networks at different time points helps assess whether a system remains stable or undergoes significant structural changes. Several methods are available for this purpose, including the commonly employed proximity statistic Jaccard Index (which measures edge overlap), graph edit distance (reflecting the minimal transformation required between two graphs), and graph kernels (functions designed to compare graph structures based on their features) (Borgwardt, 2007; Haussler, 1999). Additionally, network alignment techniques can be applied to compare networks and identify similarities. Two alignment strategies are typically used: local network alignment, which compares the building blocks of two networks, such as motifs; and global network alignment, which seeks to align entire networks by maximising structural overlap (superimposition) in a way that preserves their overall organisation (Meng et al., 2016; Milano et al., 2018). Each of these approaches constitutes a rich research domain in its own right. While a detailed discussion is beyond the scope of this review, several excellent surveys provide comprehensive overviews (Kriege et al., 2020; Guzzi and Milenković, 2018; Singh et al., 2008).

4.1.3. Monitoring community evolution

This task focuses on how communities form, evolve, and dissolve within TNs. Key phenomena include community persistence, emergence, splitting, merging, and death, as outlined earlier (Figure 4). Several advanced algorithms have been adapted to capture these dynamics. For instance, the Infomap algorithm is a flow-based community detection method that tracks the evolution of communities across time (De Domenico et al., 2015). The Generalised Louvain method, on the other hand, extends modularity-based community detection by optimising both within-layer and between-layer structures (Mucha et al., 2010). Conversely, Dynamic Stochastic Block Models (DSBMs) provide a probabilistic framework to model community transitions across networks by inferring latent group structures and their evolution over time (Xu and Hero, 2013; Xu and Hero, 2014). Additional methods include identifying persistent cliques across time points (Afsarmanesh Tehrani and Magnani, 2018; Palla et al., 2007; Palla et al., 2005), detecting temporal communities via frequent pattern mining (e.g., ABACUS algorithm) (Han et al., 2007; Berlingerio et al., 2013), or modelling smooth community transitions through evolutionary clustering, which balances temporal stability with clustering quality (e.g., Facetnet framework) (L et al., 2008; Folino and Pizzuti, 2010).

4.2. Key challenges and future directions

While the analytical frameworks described above provide a powerful toolkit for dissecting TNs, their application to biological systems exposes a central tension: inference is the bottleneck, and prediction is the temptation. Inference asks whether we can reconstruct a temporally faithful network from sparse, noisy, and irregular measurements, whereas prediction asks whether those inferred dynamics can be used to forecast future states or responses. In practice, weak inference (e.g., unstable edges under windowing choices, uncertain pseudotime orderings, or unvalidated directionality) can propagate into confident but fragile predictive models (Alali and Imani, 2022; Blonder et al., 2012; Diaz and Stumpf, 2022). We therefore organise the remaining challenges around building defensible TN models and deploying them responsibly for prediction.

4.2.1. Inference: data sparsity and temporal resolution

A primary challenge for applying TN analysis in biology stems from the nature of the data itself. Theoretical frameworks often assume high-resolution, continuous data streams, yet biological experiments are constrained by throughput, cost, and perturbation limits, resulting in coarse, irregularly sampled and incomplete datasets (Alali and Imani, 2022). This discrepancy between the ideal and the achievable can introduce significant analytical artefacts, most notably temporal aliasing.

When transient but pivotal molecular events, such as sub-second kinetics of protein-ligand binding or minutes-long phosphorylation cascades, fall between sampling points, they are missed entirely. For example, infrequent sampling of the yeast metabolic cycle can fail to capture critical oscillatory dynamics, leading to incorrect conclusions about metabolic regulation (Tu et al., 2005). Additionally, the identification of time-respecting paths is highly sensitive to missing data (Gauvin et al., 2022). In the EGF signalling pathway, for instance, sparse measurement might suggest a direct causal path (e.g., EGF → ERK), omitting the rapid intermediate events (EGF → RAS → RAF → MEK → ERK), where key proteins like MEK are active for only a few minutes (Sun and Wang, 2019; Han et al., 1993; Ambrosio et al., 1989; Marshall, 1995). Poor temporal resolution risks fundamentally misinterpreting the mechanism of signal propagation and overlooking potential drug targets (Degirmenci et al., 2020; Zhong et al., 2021). Similarly, the gradual assembly or disassembly of protein complexes, such as the exosome during cellular stress responses, can be misinterpreted as an abrupt event rather than a coordinated modular reconfiguration (Gavin et al., 2006; Gasch et al., 2000; Schlossarek et al., 2022). Mitigating these challenges represents a critical frontier, as simply increasing sampling frequency is often not practically or financially feasible.

Data-driven and statistical enhancement strategies have emerged to infer this missing information. Advanced interpolation techniques, such as Gaussian Process (GP) regression, offer a robust framework for modelling non-linear dynamics. GP regression utilises observed data points to infer intermediate states probabilistically, allowing researchers to quantify the uncertainty of these interpolations (Campbell and Yau, 2016; Märtens et al., 2019; Buettner et al., 2014). This technique has been successfully used to reconstruct gene expression trajectories in developmental biology from sparse measurements (Stegle et al., 2010; Äijö et al., 2018). Other methods, including those based on matrix factorisation or network propagation, can further enhance the interpolation by estimating the likelihood of interactions between discrete time measurements, effectively filling gaps (Newaz and Milenković, 2020; Yu et al., 2017). A distinct but equally important challenge arises with event-based data, which consists of discrete interaction timestamps rather than continuous measurements. While methods tailored for such event data are conceptually well-suited to biology due to their robustness to irregular sampling, their application has so far been limited, representing a significant area for future methodological development (Holme, 2015; Masuda and Holme, 2019; Paranjape et al., 2017).

Integrating multi-omics (e.g., transcriptomics, proteomics, epigenomics) and prior knowledge provides a complementary way to constrain network inference, reducing ambiguity (Subramanian et al., 2020; Sanches et al., 2024; Conard et al., 2021). For instance, combining chromatin accessibility data (ATAC-seq) with time-series RNA-seq can uncover regulatory cascades that are not evident from either dataset alone (Marku and Pancaldi, 2023; Liu et al., 2017; Duren et al., 2020). The accessibility data provides priors on which TFs can bind at specific times, thereby refining the interpretation of downstream transcriptional changes. Furthermore, leveraging prior biological knowledge by using known PPI networks, gene regulatory maps, or TF binding sites as structural scaffolds can guide the inference process (Stock et al., 2025; Padi and Quackenbush, 2015; Ideker et al., 2011). This approach helps to avoid biologically implausible connections that may arise from noisy time-series data, thereby yielding a more robust model of regulatory activation (Marku and Pancaldi, 2023; Chang et al., 2012).

Model-based inference represents a final, powerful paradigm that moves beyond pattern recognition toward explicit mathematical formulations of expected network dynamics, effectively encoding formal hypotheses about underlying regulatory mechanisms (Mercatelli et al., 2020; Lopatkin and Collins, 2020). Such approaches include Boolean networks, which model genes as binary switches; Bayesian networks, which use probability to identify time-consistent propagation paths; and systems of ordinary differential equations (ODEs), which describe the rates of change of molecular concentrations (Ajmal and Madden, 2023; Quach et al., 2007; S et al., 2002). Sparse experimental data are then used to calibrate these models, estimate their kinetic parameters, and select the topology that best explains the observations. Although computationally intensive, these approaches can move beyond mere correlation to a causal and predictive understanding (Cheng et al., 2024; Neapolitan, 2004). A key distinction is whether methods adopt deterministic or probabilistic frameworks to represent biology. Deterministic models (e.g., ODE systems) map the same initial condition to the same outcome, reflecting predictable dynamics (Hsu and Chen, 2022; Clermont et al., 2007). Probabilistic models (e.g., Bayesian networks) instead encode uncertainty and stochasticity, producing distributions of likely outcomes rather than single predictions (Lecca et al., 2013; Wade, 2000). In GRNs, Bayesian networks are widely used to support causal hypotheses by modelling probabilistic dependencies among genes, which is well-suited to sparse and noisy data (Friedman et al., 2000; Sachs et al., 2005). A well-parameterised mechanistic model, whether deterministic or probabilistic, can simulate the system’s response to perturbations and predict future states, fulfilling a core objective of systems biology.

4.2.2. Validation and benchmarking

If inference is the bottleneck, then validation is the quality control layer that determines whether downstream temporal interpretation is biologically meaningful. Consistent with the QC “gate” in Figure 1, validation determines whether observed temporal patterns are defensible biological dynamics or artefacts of sampling, windowing, or model class. This is especially critical in temporal biology, where sparse sampling, windowing decisions, and model assumptions can produce multiple plausible, but incompatible, TNs from the same dataset. Practical validation should be matched to the time regime (Box 1) and to edge semantics (Box 2) of the TN analysis in question.

Sensitivity analysis serves as a vital first step in testing the robustness of modelling choices. Because temporal discretisation and window size can drastically reshape graph topology, hub rankings, and module structure, networks should be re-inferred under a range of window sizes or smoothing strengths (Krings et al., 2012; Bovet et al., 2022). At a minimum, researchers should report the stability of key outputs such as edge overlap and the persistence of modules (Gelardi et al., 2021; Shakil et al., 2016). For association networks, this check often distinguishes genuine rewiring from artefacts of aggregation (Cencetti et al., 2021; Rohrschneider et al., 2010).

Wherever sample size permits, uncertainty and stability should also be quantified. Techniques such as bootstrapping or subsampling can estimate confidence in inferred edges and derived features (hubs/modules), revealing whether conclusions depend on a small subset of samples (Colby et al., 2018; Langfelder et al., 2011). This is particularly relevant for pseudotime-driven analyses, where the time “axis” is itself inferred (Tritschler et al., 2019; Saelens et al., 2019). Model-based inference benefits similarly from Bayesian formulations that output distributions over parameters rather than point estimates, providing a more honest presentation of the model’s certainty (Husmeier, 2003; Golightly and Wilkinson, 2011).

Additionally, null models provide the necessary baseline for evaluating temporal claims. Unlike static null models, temporal reference models must preserve relevant structure, like event rates or inter-event times, while randomising others (Gauvin et al., 2022; Pedreschi et al., 2022; Ceria and Wang, 2023). This testing is essential for confirming whether observed dynamics, such as time-respecting paths, temporal motifs, or community evolution, exceed what would be expected from sampling noise alone. Without these constraints, missing data and discretisation are prone to creating “phantom” patterns that lack a biological basis (Smiljanić et al., 2020; Hobson et al., 2021).

Finally, external and orthogonal validation represents the highest tier of evidence, grounding inference in experimental reality (Marku and Pancaldi, 2023; Kim et al., 2023; Kamimoto et al., 2023). While partial external validation, such as enrichment of inferred edges for known PPIs or TF-binding motifs, is a common starting point for increasing interpretability, multi-omics integration provides a more rigorous filter by requiring consistency across modalities (Bravo González-Blas et al., 2023; Kernfeld et al., 2024; Wu et al., 2025; Azad et al., 2021). For example, chromatin accessibility can support or penalise TF → target edges inferred from expression (Sanches et al., 2024; Bravo González-Blas et al., 2023; Jiang et al., 2022). Moving toward causal inference, benchmarking is accelerating in settings where directionality is supported by interventions. Initiatives like CausalBench for perturbational single-cell data and Temporal Graph Benchmark 2.0 (TGB 2.0) for large-scale link prediction provide standardised metrics and reproducible pipelines for these regimes (Chevalley et al., 2023; Gastinger et al., 2024). These benchmarks allow for a clear distinction between interventional causal discovery (CausalBench) and temporal link forecasting under strict time-split evaluation (TGB 2.0). Grounding directionality in such perturbations or temporal ordering, rather than correlation alone, is essential for robust network reconstruction (Tejada-Lapuerta et al., 2025; Weinstock et al., 2024). Consequently, when translating dynamic graph learning into biology, evaluation must respect temporal ordering to avoid data leakage; at a minimum, explicit temporal splits and task definitions should be reported to ensure performance is not artificially inflated (Gastinger et al., 2024; Longa et al., 2023; Lampert et al., 2024). Such transparent protocols are particularly vital for differential network and rewiring methods, which often disagree and require comparative assessment on shared, reproducible evaluation pipelines (Galindez et al., 2023; Sharma et al., 2021). Ultimately, these validation layers convert TNs from attractive visual narratives into defensible biological models: inference becomes a claim that can be tested, rather than just a structure that can be plotted.

4.2.3. Harnessing predictive power with AI

The transition from descriptive analysis and inference to predictive modelling marks the next critical frontier for the field. Predicting future network states, such as therapeutic response or disease onset, requires models capable of handling both temporal dependencies and biological complexity (Wang et al., 2018). In practice, many mature “temporal GNN” (T-GNN) deployments in biomedicine operate on patient-trajectory graphs built from electronic health records or on longitudinal brain connectivity graphs, where outcomes are directly observed (Galindez et al., 2023; Boll et al., 2024). However, when the network is inferred, predictive gains can reflect windowing/inference choices or information leakage. This leakage frequently occurs via “look-ahead bias,” where future information is inadvertently baked into the current state. For example, when a graph autoencoder uses an adjacency matrix that includes edges from the entire study duration to generate embeddings for a baseline time point (Kaufman et al., 2012). Unless evaluation explicitly separates time (using “rolling window” validation), individuals (to test inductive generalisation), and interventions, reported accuracies may be artificially inflated. Therefore, claims of forecasting must explicitly state whether the model predicts outcomes given a fixed graph, future edges/rewiring, or latent states under a mechanistic model.

T-GNNs have emerged as a particularly promising class of deep learning models for these tasks. Unlike static counterparts such as Node2vec, T-GNNs are explicitly designed to learn from evolving topologies and node features, making them well-suited for biological dynamics (Nguyen et al., 2018; Grover and Leskovec, 2016; Perozzi et al., 2014; Zhang et al., 2021). Recent applications in oncology highlight this potential: T-GNNs trained on longitudinal gene expression networks have demonstrated superior accuracy in predicting drug sensitivity compared to models relying on static snapshots (Campana et al., 2024; Nguyen et al., 2021). Such models capture the dynamic rewiring of regulatory pathways that determines a cell’s fate, offering mechanistic insights into drug response and resistance (Campana et al., 2024; Kim S. et al., 2021). Identifying disease “tipping points” represents another high-impact application of these architectures. T-GNNs can be trained on longitudinal multi-omics data to recognise the subtle network reconfigurations that serve as early-warning signals for abrupt transitions from health to disease. This approach has shown promise in the study of Alzheimer’s and other complex, progressive pathologies (Kim M. et al., 2021; Liu et al., 2019; Chen et al., 2017). However, applying these advanced AI models presents unique challenges, namely, the risk of model overfitting on small training datasets and the difficulty of capturing profound non-linearities of biological processes (Gao et al., 2023; Rajendra and Brahmajirao, 2020).

The integration of prior knowledge remains the best defence against these computational pitfalls (Kazemi et al., 2022). The most robust predictive models will therefore be those that are grounded in biological reality, using curated PPI networks or pathway databases to constrain the model’s hypothesis space (Tripathy et al., 2025; Yan et al., 2024). This not only improves predictive accuracy on limited data but also ensures the model’s outputs are mechanistically interpretable. This evolution, from descriptive metrics to robust inference and now toward AI-driven prediction, signals a paradigm shift. The convergence of time-aware network science, mechanistic modelling, and artificial intelligence promises to transform our ability to understand, predict, and ultimately control dynamic cellular systems, paving the way for precision medicine and actionable clinical insights.

4.3. Practical workflow guide for method selection

To consolidate the practical workflow developed across the review, Table 2 summarises representative temporal network construction, analysis, validation, and prediction families across common biological settings, together with their typical applicability, software availability, and recurrent limitations. Rather than serving as an exhaustive catalogue, the table is intended as a practical map from data characteristics to defensible methodological choices.

TABLE 2.

Representative temporal network workflow families in systems biology. The table is organised into four workflow-oriented panels covering graph construction and network inference, structural comparison and mesoscale analysis, validation and benchmarking, and prediction on validated temporal graphs. It is intended as a practical, non-exhaustive guide linking common biological data settings and analytical aims to representative implementations, major strengths, and key limitations.

Method family Best suited to Representative software/Implementation Main strengths Main limitations/Cautions
Graph construction and network inference Event-stream temporal analysis Directly time-stamped interactions, contact/proximity data, signaling events, or interaction logs networkDynamic (Butts et al., 2016; Butts et al., 2014), tsna (Saqr, 2023; Saqr, 2024), ndtv (Bender-deMoll, 2024), Statnet project (Handcock et al., 2008) (R); Teneto (Thompson et al., 2017), NetworkX-Temporal (Passos et al., 2025) (Python) Preserves event order; supports time-respecting paths, temporal centrality, and event-level motifs Requires sufficiently resolved timestamps and reasonably complete event capture; motif results depend on temporal windowing and null choice
Snapshot-based evolving networks Repeated measurements at discrete time points or stage-indexed cohorts igraph (Csardi and Nepusz, 2006) (R/Python) + custom workflow; multinet (Magnani et al., 2021) for multilayer summaries, networkDynamic (Butts et al., 2016; Butts et al., 2014), tsna (Saqr, 2023; Saqr, 2024), ndtv (Bender-deMoll, 2024), Statnet project (Handcock et al., 2008) (R) Simple and interpretable; compatible with standard network measures and direct snapshot comparison Sensitive to thresholding, missingness, and density differences across snapshots
Sliding-window networks Moderately sampled time series when smoother temporal trends are desired NetworkX-temporal (Passos et al., 2025), Teneto (Thompson et al., 2017) (Python); custom scripts Can reduce fragmentation and reveal gradual meso- or macro-scale change Window size and placement can reshape topology and generate apparent rewiring artefacts
Dynamic GRN inference with DBNs/tree ensembles/ODEs Time-series transcriptomics, when directed regulatory influence is of interest dynGENIE3 (Huynh-Thu and Geurts, 2018) (R/Python/MATLAB); dbnR (Quesada et al., 2025), dynUGENE (Lu and Silva, 2021) (R) Explicit dynamical assumptions; can support directed hypotheses and perturbation-style simulation Sample-hungry; parameter identifiability and model class strongly affect conclusions; directionality remains inferential without intervention
Multi-omics constrained temporal GRNs Matched or harmonised RNA + ATAC/TF-binding/perturbation data SCENIC+ (Bravo González-Blas et al., 2023), CellOracle (Kamimoto et al., 2023) (Python); TIMEOR (Conard et al., 2021) (web/R) Constrains biologically implausible edges and can improve mechanistic plausibility Modality alignment, prior bias, and assay-specific noise can dominate the inferred network
Trajectory/pseudotime-based temporal inference Single-cell snapshots where progression is latent or only partly time-stamped OTVelo (Zhao et al., 2025); SCENIC+ (Bravo González-Blas et al., 2023), CellOracle (Kamimoto et al., 2023) (Python); Slingshot (Street et al., 2018), Monocle 3 (Cao et al., 2019) (R) Extracts time-like structure from snapshot data and supports candidate regulator prioritisation along trajectories Ordering uncertainty and branch choice propagate downstream; pseudotime is not observed ground truth
Structural comparison and mesoscale analysis Rewiring/differential network analysis Comparisons across conditions, stages, or successive windows DDN3 (Fu et al., 2024) (Python); DiffGraph (Gill et al., 2014), DINeR (Zhang et al., 2020) (R); custom workflows Directly targets changing edges and condition-specific coordination Results depend strongly on upstream network construction, and different methods may disagree
Network similarity and alignment Quantifying stability or change between snapshots or conditions NetworkX (Passos et al., 2025), igraph (R/Python) (Csardi and Nepusz, 2006); GraKeL (for kernels) (Siglidis et al., 2020) (Python) Useful for screening whether change is local or global, and for formal pairwise comparison Different metrics emphasise different structure; edit-distance approaches can become computationally expensive
Temporal motifs and dynamic graphlets Event-resolved data or datasets with sufficiently fine temporal resolution SNAP temporal motif code (Paranjape et al., 2017), dynamic graphlet research code (Hulovatyy et al., 2015); custom motif pipelines Captures local temporal wiring patterns beyond static subgraphs Interpretability falls when sampling is sparse; counts depend on temporal resolution and null specification
Multilayer community detection Layered networks where persistence and cross-layer coupling matter multinet (Magnani et al., 2021) (R); Py3plex (Škrlj et al., 2019) (Python); GenLouvain (Jutla et al., 2011) (MATLAB) Tracks persistent or shifting modules while borrowing strength across layers Coupling and resolution parameters can dominate results; labels may be unstable across runs
Dynamic stochastic block models Networks where latent group structure and transition probabilities are of interest dynsbm (Matias and Miele, 2017), NetMix (Olivella et al., 2022) (R) Probabilistic treatment of community evolution with an explicit transition model Stronger modelling assumptions and heavier computation; may underfit diffuse or non-block structure
Frequent-pattern/clique-based community evolution Persistence-focused analyses seeking recurring or overlapping modules multinet (abacus, clique percolation) (Afsarmanesh Tehrani and Magnani, 2018; Berlingerio et al., 2013; Magnani et al., 2021) (R); FacetNet (L et al., 2008) implementations mostly custom/unofficial Useful for recurrent or overlapping communities across snapshots Can favor only highly recurring modules, miss diffuse structure, and be sensitive to support thresholds
Validation and benchmarking Robustness, sensitivity, and uncertainty assessment All temporal network studies, especially sparse or inference-heavy settings Largely custom workflows; Window-size/threshold/resampling sensitivity, bootstrap or subsampling stability, uncertainty propagation for inferred time or edges CausalBench (Chevalley et al., 2023); TGB 2.0 (Gastinger et al., 2024) Helps distinguish robust dynamics from artefacts of modelling choices, and supports leakage-safe evaluation No single universal benchmark; validation must match time regime and edge semantics; often omitted because it is labour-intensive; does not prove correctness, but can show fragility
Temporal null models and reference models Testing whether temporal motifs, paths, rewiring, or community events exceed what sampling alone would produce (non-random) Mostly custom workflows; randomised reference models preserving selected temporal constraints Makes temporal claims falsifiable rather than purely descriptive Choice of preserved statistics matters as much as the test itself (preserving the wrong statistics can make the test uninformative or misleading)
Benchmark resources for inference and forecasting evaluation Method development, comparative evaluation, and leakage-aware benchmarking CausalBench for perturbation-based network inference benchmarking (Chevalley et al., 2023); TGB 2.0 for time-respecting future-link forecasting benchmarks (Gastinger et al., 2024) Encourages reproducible, shared evaluation rather than one-off performance claims Benchmark success does not automatically imply biological validity in a new dataset; benchmark and application regime must match
External/orthogonal validation GRN and directionality claims that need biological support beyond correlation Modality-specific support (perturbation evidence, matched chromatin accessibility, TF-binding or prior biological evidence); generally custom integration workflows Provides the strongest support for biological plausibility Evidence is often partial and context-specific; lack of support is not always direct falsification
Prediction on validated temporal graphs Temporal graph learning/temporal graph neural networks T-GNNs Forecasting future links, node states, or graph-level outcomes from a validated temporal graph object Temporal Graph Networks, temporal graph embedding, temporal GNN libraries such as PyTorch Geometric Temporal (Rozemberczki et al., 2021) (Python) Can capture complex nonlinear temporal dependencies and interactions that are difficult to specify manually Performance can be inflated by risk of data leakage, overfitting, and sensitivity to graph construction choices; often less interpretable than mechanistic models
Mechanistic or perturbation-oriented forecasting on inferred regulatory graphs Questions about regulatory response, intervention effects, or likely consequences of perturbing nodes in a validated GRN Dynamic Bayesian/ODE (Quach et al., 2007)/state-space simulation, in silico perturbation frameworks such as CellOracle (Kamimoto et al., 2023) Often biologically interpretable and hypothesis-generating; closer to intervention logic than black-box forecasting Forecast quality is bounded by the validity of the inferred network and the mechanistic assumptions built into the model

Software examples are representative rather than exhaustive. Where no dominant package exists, the table states this explicitly to avoid overstating standardisation in the field.

5. Conclusion

Static network analysis has provided foundational insights into biological organisation, but many core biological phenomena are better understood as processes unfolding on networks rather than properties of a single fixed graph. Incorporating time reveals that biological function is encoded not only in connectivity, but in how connectivity is reconfigured: edges emerge and disappear, modules reorganise, and causal influence depends on temporal order. A multi-scale temporal perspective, from nodes and edges (micro), to motifs and communities (meso), to global topology (macro), offers a more faithful lens on mechanisms such as signalling, differentiation, and disease progression.

A unifying message of this review is captured by the thesis: inference is the bottleneck; prediction is the temptation. The central constraint in biological TNs is not the lack of analytical tools, but the mismatch between idealised high-resolution temporal models and the sparse, noisy, and irregularly sampled data available in practice. This mismatch can yield temporal aliasing, incomplete time-respecting paths, and ambiguous rewiring narratives if inference assumptions are not made explicit. The most robust path forward integrates complementary strategies: statistical enhancement for sparse sampling, biologically constrained inference using multi-omics and prior knowledge, and mechanistic model-based approaches that elevate TNs from correlation structures toward causal hypotheses.

At the same time, the field is being pulled toward prediction. Temporal graph learning and T-GNNs offer powerful frameworks for forecasting outcomes such as drug response trajectories or impending disease transitions, and early applications demonstrate clear promise (Kazemi et al., 2022; Besharatifard and Vafaee, 2024). However, predictive modelling in biology is especially vulnerable to overfitting, dataset bias, and evaluation artefacts, making validation and benchmarking essential rather than optional. Trustworthy temporal biology will increasingly depend on explicit edge semantics, explicit time regimes, and transparent evaluation protocols that respect temporal ordering and biological plausibility.

Looking ahead, the most impactful advances will likely come from tighter coupling between inference, validation, and prediction: models that integrate priors and multi-omics constraints to remain interpretable, quantify uncertainty, and generalise across cohorts and contexts. Achieving this will require sustained collaboration between experimentalists and computational scientists, and a continued shift from “networks that look dynamic” to dynamic network models that withstand falsification and support intervention.

Funding Statement

The author(s) declared that financial support was received for this work and/or its publication. Abir Khazaal is supported by an Australian Government Research Training Program (RTP) Scholarship.

Footnotes

Edited by: Paola Lecca, Free University of Bozen-Bolzano, Italy

Reviewed by: Yizhi Wang, Virginia Tech, United States

Italo Ivo Lima Dias Pinto, University of São Paulo, Brazil

Author contributions

AK: Conceptualization, Data curation, Formal Analysis, Investigation, Methodology, Software, Visualization, Writing – original draft, Writing – review and editing. FV: Conceptualization, Funding acquisition, Project administration, Resources, Supervision, Writing – review and editing.

Conflict of interest

The author(s) declared that this work was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.

Generative AI statement

The author(s) declared that generative AI was used in the creation of this manuscript. Generative AI tools were used only to assist with language editing; no original scientific content was generated by AI, and all content was fully reviewed and approved by the authors.

Any alternative text (alt text) provided alongside figures in this article has been generated by Frontiers with the support of artificial intelligence and reasonable efforts have been made to ensure accuracy, including review by the authors wherever possible. If you identify any issues, please contact us.

Publisher’s note

All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.

Supplementary material

The Supplementary Material for this article can be found online at: https://www.frontiersin.org/articles/10.3389/fbinf.2026.1822526/full#supplementary-material

DataSheet1.pdf (2.3MB, pdf)

References

  1. Aalto A., Viitasaari L., Ilmonen P., Mombaerts L., Gonçalves J. (2020). Gene regulatory network inference from sparsely sampled noisy data. Nat. Commun. 11, 3493. 10.1038/s41467-020-17217-1 [DOI] [PMC free article] [PubMed] [Google Scholar]
  2. Afsarmanesh Tehrani N., Magnani M. (2018). Partial and overlapping community detection in multiplex social networks. Springer, 15–28. [Google Scholar]
  3. Ahmad F. H., Wu X. N., Stintzi A., Schaller A., Schulze W. X. (2019). The systemin signaling Cascade as derived from time course analyses of the systemin-responsive phosphoproteome*[S]. Mol. Cell Proteomics 18, 1526–1542. 10.1074/mcp.RA119.001367 [DOI] [PMC free article] [PubMed] [Google Scholar]
  4. Äijö T., Müller C. L., Bonneau R. (2018). Temporal probabilistic modeling of bacterial compositions derived from 16S rRNA sequencing. Bioinformatics 34, 372–380. 10.1093/bioinformatics/btx549 [DOI] [PMC free article] [PubMed] [Google Scholar]
  5. Ajmal H. B., Madden M. G. (2023). A review of Bayesian modelling methods for gene regulatory network inference. Bioinformatics 1, 1–3. [Google Scholar]
  6. Akbarzadeh S., Coşkun Ö., Günçer B. (2024). Studying protein–protein interactions: latest and Most popular approaches. J. Struct. Biol. 216, 108118. 10.1016/j.jsb.2024.108118 [DOI] [PubMed] [Google Scholar]
  7. Alali M., Imani M. (2022). Inference of regulatory networks through temporally sparse data. Front. Control Eng. 3, 1017256. 10.3389/fcteg.2022.1017256 [DOI] [PMC free article] [PubMed] [Google Scholar]
  8. Albert R., Barabási A.-L. (2000). Topology of evolving networks: local events and universality. Phys. Rev. Lett. 85, 5234–5237. 10.1103/PhysRevLett.85.5234 [DOI] [PubMed] [Google Scholar]
  9. Albert R., Barabási A.-L. (2002). Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47–97. 10.1103/revmodphys.74.47 [DOI] [Google Scholar]
  10. Alcalá-Corona S. A., Sandoval-Motta S., Espinal-Enriquez J., Hernandez-Lemus E. (2021). Modularity in biological networks. Front. Genet. 12, 701331. 10.3389/fgene.2021.701331 [DOI] [PMC free article] [PubMed] [Google Scholar]
  11. Ambrosio L., Mahowald A. P., Perrimon N. (1989). Requirement of the drosophila raf homologue for torso function. Nature 342, 288–291. 10.1038/342288a0 [DOI] [PubMed] [Google Scholar]
  12. Arenas A., Fernandez A., Fortunato S., Gomez S. (2008). Motif-based communities in complex networks. J. Phys. Math. Theor. 41, 224001. 10.1088/1751-8113/41/22/224001 [DOI] [Google Scholar]
  13. Azad A., Fatima S., Capraro A., Waters S. A., Vafaee F. (2021). Integrative resource for network-based investigation of COVID-19 combinatorial drug repositioning and mechanism of action. Patterns 2, 100325. 10.1016/j.patter.2021.100325 [DOI] [PMC free article] [PubMed] [Google Scholar]
  14. Bender-deMoll S. (2024). Package vignette for ndtv: network dynamic temporal visualizations. [Google Scholar]
  15. Berlingerio M., Pinelli F., Calabrese F. (2013). Abacus: frequent pattern mining-based community discovery in multidimensional networks. Data Min. Knowl. Discov. 27, 294–320. 10.1007/s10618-013-0331-0 [DOI] [Google Scholar]
  16. Besharatifard M., Vafaee F. (2024). A review on graph neural networks for predicting synergistic drug combinations. Artif. Intell. Rev. 57, 49. 10.1007/s10462-023-10669-z [DOI] [Google Scholar]
  17. Blazek M., Santisteban T. S., Zengerle R., Meier M. (2015). Analysis of fast protein phosphorylation kinetics in single cells on a microfluidic chip. Lab. Chip 15, 726–734. 10.1039/c4lc00797b [DOI] [PubMed] [Google Scholar]
  18. Blonder B., Wey T. W., Dornhaus A., James R., Sih A. (2012). Temporal dynamics and network analysis. Methods Ecol. Evol. 3, 958–972. 10.1111/j.2041-210x.2012.00236.x [DOI] [Google Scholar]
  19. Boccaletti S., Latora V., Moreno Y., Chavez M., Hwang D.-U. (2006). Complex networks: structure and dynamics. Phys. Rep. 424, 175–308. 10.1016/j.physrep.2005.10.009 [DOI] [Google Scholar]
  20. Boland M. J., Nazor K. L., Loring J. F. (2014). Epigenetic regulation of pluripotency and differentiation. Circ. Res. 115, 311–324. 10.1161/CIRCRESAHA.115.301517 [DOI] [PMC free article] [PubMed] [Google Scholar]
  21. Boll H. O., Amirahmadi A., Ghazani M. M., de Morais W. O., de Freitas E. P., Soliman A., et al. (2024). Graph neural networks for clinical risk prediction based on electronic health records: a survey. J. Biomed. Inf. 151, 104616. 10.1016/j.jbi.2024.104616 [DOI] [PubMed] [Google Scholar]
  22. Borgwardt K. M. (2007). Graph kernels. [Google Scholar]
  23. Bornholdt S., Schuster H. G. (2001). Handbook of graphs and networks. [Google Scholar]
  24. Bovet A., Delvenne J.-C., Lambiotte R. (2022). Flow stability for dynamic community detection. Sci. Adv. 8, eabj3063. 10.1126/sciadv.abj3063 [DOI] [PMC free article] [PubMed] [Google Scholar]
  25. Braha D., Bar-Yam Y. (2009). “Time-dependent complex networks: dynamic centrality, dynamic motifs, and cycles of social interactions,” in Adaptive networks: theory, models and applications. Springer, 39–50. [Google Scholar]
  26. Bravo González-Blas C., De Winter S., Hulselmans G., Hecker N., Matetovici I., Christiaens V., et al. (2023). SCENIC+: single-cell multiomic inference of enhancers and gene regulatory networks. Nat. Methods 20, 1355–1367. 10.1038/s41592-023-01938-4 [DOI] [PMC free article] [PubMed] [Google Scholar]
  27. Buettner F., Moignard V., Göttgens B., Theis F. J. (2014). Probabilistic PCA of censored data: accounting for uncertainties in the visualization of high-throughput single-cell qPCR data. Bioinformatics 30, 1867–1875. 10.1093/bioinformatics/btu134 [DOI] [PMC free article] [PubMed] [Google Scholar]
  28. Butts C. T., Leslie-Cook A., Krivitsky P. N., Bender-deMoll S. (2014). networkDynamic: dynamic extensions for network objects. [Google Scholar]
  29. Butts C. T., Leslie-Cook A., Krivitsky P. N., Bender-deMoll S., Almquist Z., Hunter D. R., et al. (2016). Package ‘networkDynamic. [Google Scholar]
  30. Caceres R. S., Fish B. (2017). A supervised approach to windowing detection on dynamic networks. 10.48550/arXiv.1702.07752 [DOI] [Google Scholar]
  31. Caceres R. S., Berger-Wolf T., Grossman R. (2011). Temporal scale of processes in dynamic networks. IEEE, 925–932. [Google Scholar]
  32. Campana P. A., Prasse P., Lienhard M., Thedinga K., Herwig R., Scheffer T. (2024). Cancer drug sensitivity estimation using modular deep graph neural networks. Nar. Genomics Bioinforma. 6, lqae043. 10.1093/nargab/lqae043 [DOI] [PMC free article] [PubMed] [Google Scholar]
  33. Campbell K. R., Yau C. (2016). Order under uncertainty: robust differential expression analysis using probabilistic models for pseudotime inference. PLoS Comput. Biol. 12, e1005212. 10.1371/journal.pcbi.1005212 [DOI] [PMC free article] [PubMed] [Google Scholar]
  34. Cao J., Spielmann M., Qiu X., Huang X., Ibrahim D. M., Hill A. J., et al. (2019). The single-cell transcriptional landscape of Mammalian organogenesis. Nature 566, 496–502. 10.1038/s41586-019-0969-x [DOI] [PMC free article] [PubMed] [Google Scholar]
  35. Casteigts A., Flocchini P., Quattrociocchi W., Santoro N. (2012). Time-varying graphs and dynamic networks. Int. J. Parallel Emergent Distrib. Syst. 27, 387–408. 10.1080/17445760.2012.668546 [DOI] [Google Scholar]
  36. Cencetti G., Battiston F., Lepri B., Karsai M. (2021). Temporal properties of higher-order interactions in social networks. Sci. Rep. 11, 7028. 10.1038/s41598-021-86469-8 [DOI] [PMC free article] [PubMed] [Google Scholar]
  37. Ceria A., Wang H. (2023). Temporal-topological properties of higher-order evolving networks. Sci. Rep. 13, 5885. 10.1038/s41598-023-32253-9 [DOI] [PMC free article] [PubMed] [Google Scholar]
  38. Chan S. S.-K., Kyba M. (2013). What is a master regulator? J. Stem Cell Res. Ther. 3, 114. 10.4172/2157-7633.1000e114 [DOI] [PMC free article] [PubMed] [Google Scholar]
  39. Chang Y. H., Gray J., Tomlin C. (2012). Optimization-based inference for temporally evolving networks with applications in biology. J. Comput. Biol. 19, 1307–1323. 10.1089/cmb.2012.0190 [DOI] [PMC free article] [PubMed] [Google Scholar]
  40. Chen P., Li Y., Liu X., Liu R., Chen L. (2017). Detecting the tipping points in a three-state model of complex diseases by temporal differential networks. J. Transl. Med. 15, 217. 10.1186/s12967-017-1320-7 [DOI] [PMC free article] [PubMed] [Google Scholar]
  41. Chen B., Hou G., Li A. (2024). Temporal local clustering coefficient uncovers the hidden pattern in temporal networks. Phys. Rev. E 109, 064302. 10.1103/PhysRevE.109.064302 [DOI] [PubMed] [Google Scholar]
  42. Cheng D., Li J., Liu L., Liu J., Le T. D. (2024). Data-driven causal effect estimation based on graphical causal modelling: a survey. ACM Comput. Surv. 56, 1–37. 10.1145/3636423 [DOI] [Google Scholar]
  43. Chevalley M., Sackett-Sanders J., Roohani Y., Notin P., Bakulin A., Brzezinski D., et al. (2023). The CausalBench challenge: a machine learning contest for gene network inference from single-cell perturbation data. ArXiv Prepr. ArXiv230815395. 10.48550/arXiv.2308.15395 [DOI] [Google Scholar]
  44. Chevalley M., Roohani Y. H., Mehrjou A., Leskovec J., Schwab P. (2025). A large-scale benchmark for network inference from single-cell perturbation data. Commun. Biol. 275, 533–551. 10.1038/s42003-025-07764-y [DOI] [PMC free article] [PubMed] [Google Scholar]
  45. Chiappori A., Cazabet R. (2021). Quantitative evaluation of snapshot graphs for the analysis of temporal networks. Springer, 566–577. [Google Scholar]
  46. Cho S.-Y., Park S.-G., Lee D.-H., Park B.-C. (2004). Protein-protein interaction networks: from interactions to networks. BMB Rep. 37, 45–52. 10.5483/bmbrep.2004.37.1.045 [DOI] [PubMed] [Google Scholar]
  47. Chou T., D’Orsogna M. R. (2014). First passage problems in biology. First-passage phenomena and their applications. World Sci., 306–345. 10.1142/9789814590297_0013 [DOI] [Google Scholar]
  48. Clermont G., Vodovotz Y., Rubin J. (2007). Equation-based models of dynamic biological systems. Endothel. Biomed., 1780–1785. 10.1017/CBO9780511546198.192 [DOI] [PMC free article] [PubMed] [Google Scholar]
  49. Colby S. M., McClure R. S., Overall C. C., Renslow R. S., McDermott J. E. (2018). Improving network inference algorithms using resampling methods. BMC Bioinforma. 19, 376. 10.1186/s12859-018-2402-0 [DOI] [PMC free article] [PubMed] [Google Scholar]
  50. Conard A. M., Goodman N., Hu Y., Perrimon N., Singh R., Lawrence C., et al. (2021). TIMEOR: a web-based tool to uncover temporal regulatory mechanisms from multi-omics data. Nucleic Acids Res. 49, W641–W653. 10.1093/nar/gkab384 [DOI] [PMC free article] [PubMed] [Google Scholar]
  51. Coscia M., Giannotti F., Pedreschi D. (2011). A classification for community discovery methods in complex networks. Stat. Anal. Data Min. ASA Data Sci. J. 4, 512–546. 10.1002/sam.10133 [DOI] [Google Scholar]
  52. Csardi G., Nepusz T. (2006). The igraph software. Complex Syst. 1695, 1–9. [Google Scholar]
  53. Cui J., Zhang Y.-Q., Li X. (2013). On the clustering coefficients of temporal networks and epidemic dynamics. IEEE, 2299–2302. 10.1109/ISCAS.2013.6572337 [DOI] [Google Scholar]
  54. Dell’Amico M., Filippone M., Michiardi P., Roudier Y. (2014). On user availability prediction and network applications. IEEEACM Trans. Netw. 23, 1300–1313. 10.1109/tnet.2014.2321430 [DOI] [Google Scholar]
  55. De Domenico M., Lancichinetti A., Arenas A., Rosvall M. (2015). Identifying modular flows on multilayer networks reveals highly overlapping organization in interconnected systems. Phys. Rev. X 5, 011027. 10.1103/physrevx.5.011027 [DOI] [Google Scholar]
  56. Degirmenci U., Wang M., Hu J. (2020). Targeting aberrant RAS/RAF/MEK/ERK signaling for cancer therapy. Cells 9, 198. 10.3390/cells9010198 [DOI] [PMC free article] [PubMed] [Google Scholar]
  57. Diaz L. P., Stumpf M. P. (2022). Gaining confidence in inferred networks. Sci. Rep. 12, 2394. 10.1038/s41598-022-05402-9 [DOI] [PMC free article] [PubMed] [Google Scholar]
  58. Ding J., Sharon N., Bar-Joseph Z. (2022). Temporal modelling using single-cell transcriptomics. Nat. Rev. Genet. 23, 355–368. 10.1038/s41576-021-00444-7 [DOI] [PMC free article] [PubMed] [Google Scholar]
  59. Duren Z., Chen X., Xin J., Wang Y., Wong W. H. (2020). Time course regulatory analysis based on paired expression and chromatin accessibility data. Genome Res. 30, 622–634. 10.1101/gr.257063.119 [DOI] [PMC free article] [PubMed] [Google Scholar]
  60. Erwin D. H., Davidson E. H. (2009). The evolution of hierarchical gene regulatory networks. Nat. Rev. Genet. 10, 141–148. 10.1038/nrg2499 [DOI] [PubMed] [Google Scholar]
  61. Fang M., Gorin G., Pachter L. (2025). Trajectory inference from single-cell genomics data with a process time model. PLoS Comput. Biol. 21, e1012752. 10.1371/journal.pcbi.1012752 [DOI] [PMC free article] [PubMed] [Google Scholar]
  62. Fernex D., Noack B. R., Semaan R. (2021). Cluster-based network modeling—From snapshots to complex dynamical systems. Sci. Adv. 7, eabf5006. 10.1126/sciadv.abf5006 [DOI] [PMC free article] [PubMed] [Google Scholar]
  63. Folino F., Pizzuti C. (2010). A multiobjective and evolutionary clustering method for dynamic networks. IEEE, 256–263. 10.1109/ASONAM.2010.23 [DOI] [Google Scholar]
  64. Fortunato S. (2010). Community detection in graphs. Phys. Rep. 486, 75–174. 10.1016/j.physrep.2009.11.002 [DOI] [Google Scholar]
  65. Friedman N., Linial M., Nachman I., Pe’er D. (2000). Using Bayesian networks to analyze expression data, 127–135. [DOI] [PubMed] [Google Scholar]
  66. Fründ J. (2021). Dissimilarity of species interaction networks: how to partition rewiring and species turnover components. Ecosphere 12, e03653. 10.1002/ecs2.3653 [DOI] [Google Scholar]
  67. Fu Y., Lu Y., Wang Y., Zhang B., Zhang Z., Yu G., et al. (2024). Ddn3. 0: determining significant rewiring of biological network structure with differential dependency networks. Bioinformatics 40, btae376. 10.1093/bioinformatics/btae376 [DOI] [PMC free article] [PubMed] [Google Scholar]
  68. Galindez G., Sadegh S., Baumbach J., Kacprowski T., List M. (2023). Network-based approaches for modeling disease regulation and progression. Comput. Struct. Biotechnol. J. 21, 780–795. 10.1016/j.csbj.2022.12.022 [DOI] [PMC free article] [PubMed] [Google Scholar]
  69. Gao Y., Sharma T., Cui Y. (2023). Addressing the challenge of biomedical data inequality: an artificial intelligence perspective. Annu. Rev. Biomed. Data Sci. 6, 153–171. 10.1146/annurev-biodatasci-020722-020704 [DOI] [PMC free article] [PubMed] [Google Scholar]
  70. Gasch A. P., Spellman P. T., Kao C. M., Carmel-Harel O., Eisen M. B., Storz G., et al. (2000). Genomic expression programs in the response of yeast cells to environmental changes. Mol. Biol. Cell 11, 4241–4257. 10.1091/mbc.11.12.4241 [DOI] [PMC free article] [PubMed] [Google Scholar]
  71. Gastinger J., Huang S., Galkin M., Loghmani E., Parviz A., Poursafaei F., et al. (2024). TGB 2.0: a benchmark for learning on temporal knowledge graphs and heterogeneous graphs. Adv. Neural Inf. Process Syst. 37, 140199–140229. 10.52202/079017-4450 [DOI] [Google Scholar]
  72. Gauvin L., Génois M., Karsai M., Kivelä M., Takaguchi T., Valdano E., et al. (2022). Randomized reference models for temporal networks. Siam Rev. 64, 763–830. 10.1137/19m1242252 [DOI] [Google Scholar]
  73. Gavin A.-C., Aloy P., Grandi P., Krause R., Boesche M., Marzioch M., et al. (2006). Proteome survey reveals modularity of the yeast cell machinery. Nature 440, 631–636. 10.1038/nature04532 [DOI] [PubMed] [Google Scholar]
  74. Gelardi V., Le Bail D., Barrat A., Claidiere N. (2021). From temporal network data to the dynamics of social relationships. Proc. R. Soc. B 288, 20211164. 10.1098/rspb.2021.1164 [DOI] [PMC free article] [PubMed] [Google Scholar]
  75. George B., Shekhar S. (2008). Time-aggregated graphs for modeling spatio-temporal networks. J. Data Semant. XI, 191–212. 10.1007/978-3-540-92148-6_7 [DOI] [Google Scholar]
  76. Gill R., Datta S., Datta S. (2014). Dna: an R package for differential network analysis. Bioinformation 10, 233–234. 10.6026/97320630010233 [DOI] [PMC free article] [PubMed] [Google Scholar]
  77. Golightly A., Wilkinson D. J. (2011). Bayesian parameter inference for stochastic biochemical network models using particle markov chain monte carlo. Interface Focus 1, 807–820. 10.1098/rsfs.2011.0047 [DOI] [PMC free article] [PubMed] [Google Scholar]
  78. Greenblatt J. F., Alberts B. M., Krogan N. J. (2024). Discovery and significance of protein-protein interactions in health and disease. Cell 187, 6501–6517. 10.1016/j.cell.2024.10.038 [DOI] [PMC free article] [PubMed] [Google Scholar]
  79. Greenfield A., Madar A., Ostrer H., Bonneau R. (2010). DREAM4: combining genetic and dynamic information to identify biological networks and dynamical models. PloS One 5, e13397. 10.1371/journal.pone.0013397 [DOI] [PMC free article] [PubMed] [Google Scholar]
  80. Grimes T., Potter S. S., Datta S. (2019). Integrating gene regulatory pathways into differential network analysis of gene expression data. Sci. Rep. 9, 5479. 10.1038/s41598-019-41918-3 [DOI] [PMC free article] [PubMed] [Google Scholar]
  81. Grover A., Leskovec J. (2016). node2vec: scalable feature learning for networks, 855–864. [DOI] [PMC free article] [PubMed] [Google Scholar]
  82. Guzzi P. H., Milenković T. (2018). Survey of local and global biological network alignment: the need to reconcile the two sides of the same coin. Brief. Bioinform 19, 472–481. 10.1093/bib/bbw132 [DOI] [PubMed] [Google Scholar]
  83. Hadlak S., Schumann H., Cap C. H., Wollenberg T. (2013). Supporting the visual analysis of dynamic networks by clustering associated temporal attributes. IEEE Trans. Vis. Comput. Graph. 19, 2267–2276. 10.1109/TVCG.2013.198 [DOI] [PubMed] [Google Scholar]
  84. Han M., Golden A., Han Y., Sternberg P. W. (1993). C. elegans lin-45 raf gene participates in let-60 ras-stimulated vulval differentiation. Nature 363, 133–140. 10.1038/363133a0 [DOI] [PubMed] [Google Scholar]
  85. Han J., Cheng H., Xin D., Yan X. (2007). Frequent pattern mining: current status and future directions. Data Min. Knowl. Discov. 15, 55–86. 10.1007/s10618-006-0059-1 [DOI] [Google Scholar]
  86. Handcock M. S., Hunter D. R., Butts C. T., Goodreau S. M., Morris M. (2008). Statnet: software tools for the representation, visualization, analysis and simulation of network data. J. Stat. Softw. 24, 1–11. 10.18637/jss.v024.i01 [DOI] [PMC free article] [PubMed] [Google Scholar]
  87. Haussler D. (1999). Convolution kernels on discrete structures. Citeseer. [Google Scholar]
  88. He X., Zhang J. (2006). Why do hubs tend to be essential in protein networks? PLoS Genet. 2, e88. 10.1371/journal.pgen.0020088 [DOI] [PMC free article] [PubMed] [Google Scholar]
  89. Hetzel L., Fischer D. S., Günnemann S., Theis F. J. (2021). Graph representation learning for single-cell biology. Curr. Opin. Syst. Biol. 28, 100347. 10.1016/j.coisb.2021.05.008 [DOI] [Google Scholar]
  90. Hobson E. A., Silk M. J., Fefferman N. H., Larremore D. B., Rombach P., Shai S., et al. (2021). A guide to choosing and implementing reference models for social network analysis. Biol. Rev. 96, 2716–2734. 10.1111/brv.12775 [DOI] [PMC free article] [PubMed] [Google Scholar]
  91. Holme P. (2015). Modern temporal network theory: a colloquium. Eur. Phys. J. B 88, 1–30. 10.1140/epjb/e2015-60657-4 [DOI] [Google Scholar]
  92. Holme P., Saramäki J. (2012). Temporal networks. Phys. Rep. 519, 97–125. 10.1016/j.physrep.2012.03.001 [DOI] [Google Scholar]
  93. Holme P., Saramäki J. (2019). Temporal network theory. Springer. [Google Scholar]
  94. Hosseinzadeh M. M., Cannataro M., Guzzi P. H., Dondi R. (2022). Temporal networks in biology and medicine: a survey on models, algorithms, and tools. Netw. Model Anal. Health Inf. Bioinforma. 12, 10. 10.1007/s13721-022-00406-x [DOI] [PMC free article] [PubMed] [Google Scholar]
  95. Hou W., Ji Z., Chen Z., Wherry E. J., Hicks S. C., Ji H. (2023). A statistical framework for differential pseudotime analysis with multiple single-cell RNA-seq samples. Nat. Commun. 14, 7286. 10.1038/s41467-023-42841-y [DOI] [PMC free article] [PubMed] [Google Scholar]
  96. Hsu S.-B., Chen K.-C. (2022). Ordinary differential equations with applications. World Scientific. 10.1142/12682 [DOI] [Google Scholar]
  97. Hugues S., Fetler L., Bonifaz L., Helft J., Amblard F., Amigorena S. (2004). Distinct T cell dynamics in lymph nodes during the induction of tolerance and immunity. Nat. Immunol. 5, 1235–1242. 10.1038/ni1134 [DOI] [PubMed] [Google Scholar]
  98. Hulovatyy Y., Chen H., Milenković T. (2015). Exploring the structure and function of temporal networks with dynamic graphlets. Bioinformatics 31, i171–i180. 10.1093/bioinformatics/btv227 [DOI] [PMC free article] [PubMed] [Google Scholar]
  99. Husein I., Mawengkang H., Suwilo S. (2019). Modeling the transmission of infectious disease in a dynamic network. Bristol, United Kingdom: IOP Publishing. [Google Scholar]
  100. Husmeier D. (2003). Sensitivity and specificity of inferring genetic regulatory interactions from microarray experiments with dynamic Bayesian networks. Bioinformatics 19, 2271–2282. 10.1093/bioinformatics/btg313 [DOI] [PubMed] [Google Scholar]
  101. Huynh-Thu V. A., Geurts P. (2018). dynGENIE3: dynamical GENIE3 for the inference of gene networks from time series expression data. Sci. Rep. 8, 3384. 10.1038/s41598-018-21715-0 [DOI] [PMC free article] [PubMed] [Google Scholar]
  102. Ideker T., Dutkowski J., Hood L. (2011). Boosting signal-to-noise in complex biology: prior knowledge is power. Cell 144, 860–863. 10.1016/j.cell.2011.03.007 [DOI] [PMC free article] [PubMed] [Google Scholar]
  103. Jeong H., Tombor B., Albert R., Oltvai Z. N., Barabási A.-L. (2000). The large-scale organization of metabolic networks. Nature 407, 651–654. 10.1038/35036627 [DOI] [PubMed] [Google Scholar]
  104. Jeong H., Mason S. P., Barabási A.-L., Oltvai Z. N. (2001). Lethality and centrality in protein networks. Nature 411, 41–42. 10.1038/35075138 [DOI] [PubMed] [Google Scholar]
  105. Jiang Y., Harigaya Y., Zhang Z., Zhang H., Zang C., Zhang N. R. (2022). Nonparametric single-cell multiomic characterization of trio relationships between transcription factors, target genes, and cis-regulatory regions. Cell Syst. 13, 737–751. 10.1016/j.cels.2022.08.004 [DOI] [PMC free article] [PubMed] [Google Scholar]
  106. Jordan D. G., Winer E. S., Salem T. (2020). The current status of temporal network analysis for clinical science: considerations as the paradigm shifts? J. Clin. Psychol. 76, 1591–1612. 10.1002/jclp.22957 [DOI] [PubMed] [Google Scholar]
  107. Jutla I. S., Jeub L. G., Mucha P. J. (2011). A generalized louvain method for community detection implemented in MATLAB. URL Httpnetwiki Amath Unc EduGenLouvain. [Google Scholar]
  108. Kamimoto K., Stringa B., Hoffmann C. M., Jindal K., Solnica-Krezel L., Morris S. A. (2023). Dissecting cell identity via network inference and in silico gene perturbation. Nature 614, 742–751. 10.1038/s41586-022-05688-9 [DOI] [PMC free article] [PubMed] [Google Scholar]
  109. Kaufman S., Rosset S., Perlich C., Stitelman O. (2012). Leakage in data mining: formulation, detection, and avoidance. ACM Trans. Knowl. Discov. Data TKDD 6, 1–21. 10.1145/2382577.2382579 [DOI] [Google Scholar]
  110. Kazemi S. M. (2022). “Dynamic graph neural networks,” in Graph neural networks: foundations, frontiers, and applications. Editors Wu L., Cui P., Pei J., Zhao L. (Singapore: Springer Nature Singapore; ), 323–349. 10.1007/978-981-16-6054-2_15 [DOI] [Google Scholar]
  111. Kernfeld E., Keener R., Cahan P., Battle A. (2024). Transcriptome data are insufficient to control false discoveries in regulatory network inference. Cell Syst. 15, 709–724. 10.1016/j.cels.2024.07.006 [DOI] [PMC free article] [PubMed] [Google Scholar]
  112. Kim B., Lee K. H., Xue L., Niu X. (2018). A review of dynamic network models with latent variables. Stat. Surv. 12, 105–135. 10.1214/18-SS121 [DOI] [PMC free article] [PubMed] [Google Scholar]
  113. Kim S., Bae S., Piao Y., Jo K. (2021a). Graph convolutional network for drug response prediction using gene expression data. Mathematics 9, 772. 10.3390/math9070772 [DOI] [Google Scholar]
  114. Kim M., Kim J., Qu J., Huang H., Long Q., Sohn K.-A., et al. (2021b). Interpretable temporal graph neural network for prognostic prediction of Alzheimer’s disease using longitudinal neuroimaging data. IEEE 2021, 1381–1384. 10.1109/bibm52615.2021.9669504 [DOI] [PMC free article] [PubMed] [Google Scholar]
  115. Kim D., Tran A., Kim H. J., Lin Y., Yang J. Y. H., Yang P. (2023). Gene regulatory network reconstruction: harnessing the power of single-cell multi-omic data. NPJ Syst. Biol. Appl. 9, 51. 10.1038/s41540-023-00312-6 [DOI] [PMC free article] [PubMed] [Google Scholar]
  116. Kivelä M., Arenas A., Barthelemy M., Gleeson J. P., Moreno Y., Porter M. A. (2014). Multilayer networks. J. Complex Netw. 2, 203–271. 10.1093/comnet/cnu016 [DOI] [Google Scholar]
  117. Koh G. C., Porras P., Aranda B., Hermjakob H., Orchard S. E. (2012). Analyzing protein–protein interaction networks. J. Proteome Res. 11, 2014–2031. 10.1021/pr201211w [DOI] [PubMed] [Google Scholar]
  118. Kovanen L., Karsai M., Kaski K., Kertész J., Saramäki J. (2011). Temporal motifs in time-dependent networks. J. Stat. Mech. Theory Exp. 2011, P11005. 10.1088/1742-5468/2011/11/p11005 [DOI] [Google Scholar]
  119. Kriege N. M., Johansson F. D., Morris C. (2020). A survey on graph kernels. Appl. Netw. Sci. 5, 1–42. 10.1007/s41109-019-0195-3 [DOI] [Google Scholar]
  120. Krings G., Karsai M., Bernhardsson S., Blondel V. D., Saramäki J. (2012). Effects of time window size and placement on the structure of an aggregated communication network. EPJ Data Sci. 1, 4. 10.1140/epjds4 [DOI] [Google Scholar]
  121. Kuhn F., Oshman R. (2011). Dynamic networks: models and algorithms, 42. New York, NY: Association for Computing Machinery, 82–96. [Google Scholar]
  122. Kulandaisamy A., Lathi V., ViswaPoorani K., Yugandhar K., Gromiha M. M. (2017). Important amino acid residues involved in folding and binding of protein–protein complexes. Int. J. Biol. Macromol. 94, 438–444. 10.1016/j.ijbiomac.2016.10.045 [DOI] [PubMed] [Google Scholar]
  123. Lin Y.-R., Chi Y., Zhu S., Sundaram H., Tseng B. L. (2008). “Facetnet: a framework for analyzing communities and their evolutions,” in Dynamic networks, 685–694. [Google Scholar]
  124. Lampert M., Blöcker C., Scholtes I. (2024). From link prediction to forecasting: addressing challenges in batch-based temporal graph learning. ArXiv Prepr. ArXiv240604897. 10.48550/arXiv.2406.04897 [DOI] [Google Scholar]
  125. Langfelder P., Luo R., Oldham M. C., Horvath S. (2011). Is my network module preserved and reproducible? PLoS Comput. Biol. 7, e1001057. 10.1371/journal.pcbi.1001057 [DOI] [PMC free article] [PubMed] [Google Scholar]
  126. Lau L. Y., Reverter A., Hudson N. J., Naval-Sanchez M., Fortes M. R., Alexandre P. A. (2020). Dynamics of gene co-expression networks in time-series data: a case study in Drosophila melanogaster embryogenesis. Front. Genet. 11, 517. 10.3389/fgene.2020.00517 [DOI] [PMC free article] [PubMed] [Google Scholar]
  127. Lecca P., Laurenzi I., Jordan F. (2013). Deterministic versus stochastic modelling in biochemistry and systems biology. Elsevier. [Google Scholar]
  128. Li C., Maini P. K. (2005). An evolving network model with community structure. J. Phys. Math. Gen. 38, 9741–9749. 10.1088/0305-4470/38/45/002 [DOI] [Google Scholar]
  129. Li X., Wu M., Kwoh C.-K., Ng S.-K. (2010). Computational approaches for detecting protein complexes from protein interaction networks: a survey. BMC Genomics 11, 1–19. 10.1186/1471-2164-11-S1-S3 [DOI] [PMC free article] [PubMed] [Google Scholar]
  130. Li A., Cornelius S. P., Liu Y.-Y., Wang L., Barabási A.-L. (2017). The fundamental advantages of temporal networks. Science 358, 1042–1046. 10.1126/science.aai7488 [DOI] [PubMed] [Google Scholar]
  131. Li J., Zhou D., Qiu W., Shi Y., Yang J.-J., Chen S., et al. (2018). Application of weighted gene co-expression network analysis for data from paired design. Sci. Rep. 8, 622. 10.1038/s41598-017-18705-z [DOI] [PMC free article] [PubMed] [Google Scholar]
  132. Li Y., Ma A., Wang Y., Guo Q., Wang C., Fu H., et al. (2024). Enhancer-driven gene regulatory networks inference from single-cell RNA-Seq and ATAC-seq data. Brief. Bioinform 25, bbae369. 10.1093/bib/bbae369 [DOI] [PMC free article] [PubMed] [Google Scholar]
  133. Li S., Hua H., Chen S. (2025). Graph neural networks for single-cell omics data: a review of approaches and applications. Brief. Bioinform 26, bbaf109. 10.1093/bib/bbaf109 [DOI] [PMC free article] [PubMed] [Google Scholar]
  134. Lichtblau Y., Zimmermann K., Haldemann B., Lenze D., Hummel M., Leser U. (2017). Comparative assessment of differential network analysis methods. Brief. Bioinform 18, 837–850. 10.1093/bib/bbw061 [DOI] [PubMed] [Google Scholar]
  135. Lin C.-C., Hsiang J.-T., Wu C.-Y., Oyang Y.-J., Juan H.-F., Huang H.-C. (2010). Dynamic functional modules in co-expressed protein interaction networks of dilated cardiomyopathy. BMC Syst. Biol. 4, 1–14. 10.1186/1752-0509-4-138 [DOI] [PMC free article] [PubMed] [Google Scholar]
  136. Liu Q., Jiang C., Xu J., Zhao M.-T., Van Bortle K., Cheng X., et al. (2017). Genome-wide temporal profiling of transcriptome and open chromatin of early cardiomyocyte differentiation derived from hiPSCs and hESCs. Circ. Res. 121, 376–391. 10.1161/CIRCRESAHA.116.310456 [DOI] [PMC free article] [PubMed] [Google Scholar]
  137. Liu X., Chang X., Leng S., Tang H., Aihara K., Chen L. (2019). Detection for disease tipping points by landscape dynamic network biomarkers. Natl. Sci. Rev. 6, 775–785. 10.1093/nsr/nwy162 [DOI] [PMC free article] [PubMed] [Google Scholar]
  138. Liu C., Ma Y., Zhao J., Nussinov R., Zhang Y.-C., Cheng F., et al. (2020). Computational network biology: data, models, and applications. Phys. Rep. 846, 1–66. 10.1016/j.physrep.2019.12.004 [DOI] [Google Scholar]
  139. Liu P., Guarrasi V., Sarıyüce A. E. (2021). Temporal network motifs: models, limitations, evaluation. IEEE Trans. Knowl. Data Eng. 35, 945–957. 10.1109/tkde.2021.3077495 [DOI] [Google Scholar]
  140. Longa A., Lachi V., Santin G., Bianchini M., Lepri B., Lio P., et al. (2023). Graph neural networks for temporal graphs: state of the art, open challenges, and opportunities. ArXiv Prepr. ArXiv230201018. 10.48550/arXiv.2302.01018 [DOI] [Google Scholar]
  141. Lopatkin A. J., Collins J. J. (2020). Predictive biology: modelling, understanding and harnessing microbial complexity. Nat. Rev. Microbiol. 18, 507–520. 10.1038/s41579-020-0372-5 [DOI] [PubMed] [Google Scholar]
  142. Lu T., Silva A. (2021). dynUGENE: an R package for uncertainty-aware gene regulatory network inference, simulation, and visualization. bioRxiv. 2021–01. 10.1101/2021.01.07.425782 [DOI] [Google Scholar]
  143. Lu X., Jain V. V., Finn P. W., Perkins D. L. (2007). Hubs in biological interaction networks exhibit low changes in expression in experimental asthma. Mol. Syst. Biol. 3, 98. 10.1038/msb4100138 [DOI] [PMC free article] [PubMed] [Google Scholar]
  144. Lucas M., Morris A., Townsend-Teague A., Tichit L., Habermann B., Barrat A. (2023). Inferring cell cycle phases from a partially temporal network of protein interactions. Cell Rep. Methods 3, 100397. 10.1016/j.crmeth.2023.100397 [DOI] [PMC free article] [PubMed] [Google Scholar]
  145. Machens A., Gesualdo F., Rizzo C., Tozzi A. E., Barrat A., Cattuto C. (2013). An infectious disease model on empirical networks of human contact: bridging the gap between dynamic network data and contact matrices. BMC Infect. Dis. 13, 1–15. 10.1186/1471-2334-13-185 [DOI] [PMC free article] [PubMed] [Google Scholar]
  146. Magnani M., Rossi L., Vega D. (2021). Analysis of multiplex social networks with R. J. Stat. Softw. 98, 1–30. 10.18637/jss.v098.i08 [DOI] [Google Scholar]
  147. Manipur I., Giordano M., Piccirillo M., Parashuraman S., Maddalena L. (2021). Community detection in protein-protein interaction networks and applications. IEEE/ACM Trans. Comput. Biol. Bioinform 20, 217–237. 10.1109/TCBB.2021.3138142 [DOI] [PubMed] [Google Scholar]
  148. Marku M., Pancaldi V. (2023). From time-series transcriptomics to gene regulatory networks: a review on inference methods. PLoS Comput. Biol. 19, e1011254. 10.1371/journal.pcbi.1011254 [DOI] [PMC free article] [PubMed] [Google Scholar]
  149. Marshall C. (1995). Specificity of receptor tyrosine kinase signaling: transient versus sustained extracellular signal-regulated kinase activation. Cell. 80, 179–185. 10.1016/0092-8674(95)90401-8 [DOI] [PubMed] [Google Scholar]
  150. Märtens K., Campbell K., Yau C. (2019). Decomposing feature-level variation with covariate gaussian process latent variable models. Long Beach, CA: PMLR, 4372–4381. [Google Scholar]
  151. Masuda N., Holme P. (2019). Detecting sequences of system states in temporal networks. Sci. Rep. 9, 795. 10.1038/s41598-018-37534-2 [DOI] [PMC free article] [PubMed] [Google Scholar]
  152. Masuda N., Lambiotte R. (2016). A guide to temporal networks. World Sci. 10.1142/q0033 [DOI] [Google Scholar]
  153. Masuda N., Klemm K., Eguíluz V. M. (2013). Temporal networks: slowing Down diffusion by long lasting interactions. Phys. Rev. Lett. 111, 188701. 10.1103/PhysRevLett.111.188701 [DOI] [PubMed] [Google Scholar]
  154. Masuda N., Miller J. C., Holme P. (2021). Concurrency measures in the era of temporal network epidemiology: a review. J. R. Soc. Interface 18, 20210019. 10.1098/rsif.2021.0019 [DOI] [PMC free article] [PubMed] [Google Scholar]
  155. Masuda N., Boyd Z. M., Garlaschelli D., Mucha P. J. (2025). Introduction to correlation networks: interdisciplinary approaches beyond thresholding. Phys. Rep. 1136, 1–39. 10.1016/j.physrep.2025.06.002 [DOI] [PMC free article] [PubMed] [Google Scholar]
  156. Matias C., Miele V. (2017). Statistical clustering of temporal networks through a dynamic stochastic block model. J. R. Stat. Soc. Ser. B Stat. Methodol. 79, 1119–1141. 10.1111/rssb.12200 [DOI] [Google Scholar]
  157. Mayran A., Khetchoumian K., Hariri F., Pastinen T., Gauthier Y., Balsalobre A., et al. (2018). Pioneer factor Pax7 deploys a stable enhancer repertoire for specification of cell fate. Nat. Genet. 50, 259–269. 10.1038/s41588-017-0035-2 [DOI] [PubMed] [Google Scholar]
  158. Mei H., Wang Z., Yang H., Li X., Xu Y. (2025). Network analysis of multivariate time series data in biological systems: methods and applications. Brief. Bioinform 26, bbaf223. 10.1093/bib/bbaf223 [DOI] [PMC free article] [PubMed] [Google Scholar]
  159. Meng L., Striegel A., Milenković T. (2016). Local versus global biological network alignment. Bioinformatics 32, 3155–3164. 10.1093/bioinformatics/btw348 [DOI] [PMC free article] [PubMed] [Google Scholar]
  160. Mercatelli D., Scalambra L., Triboli L., Ray F., Giorgi F. M. (2020). Gene regulatory network inference resources: a practical overview. Biochim. Biophys. Acta BBA-Gene Regul. Mech. 1863, 194430. 10.1016/j.bbagrm.2019.194430 [DOI] [PubMed] [Google Scholar]
  161. Micheau O., Tschopp J. (2003). Induction of TNF receptor I-mediated apoptosis via two sequential signaling complexes. Cell 114, 181–190. 10.1016/s0092-8674(03)00521-x [DOI] [PubMed] [Google Scholar]
  162. Milano M., Guzzi P. H., Cannataro M. (2018). Glalign: a novel algorithm for local network alignment. IEEE/ACM Trans. Comput. Biol. Bioinform 16, 1958–1969. 10.1109/TCBB.2018.2830323 [DOI] [PubMed] [Google Scholar]
  163. Mitra S., Bp K., Cr S., Saikumar N. V., Philip P., Narayanan M. (2024). Alzheimer’s disease rewires gene coexpression networks coupling different brain regions. NPJ Syst. Biol. Appl. 10, 50. 10.1038/s41540-024-00376-y [DOI] [PMC free article] [PubMed] [Google Scholar]
  164. Mittnenzweig M., Mayshar Y., Cheng S., Ben-Yair R., Hadas R., Rais Y., et al. (2021). A single-embryo, single-cell time-resolved model for mouse gastrulation. Cell 184, 2825–2842. 10.1016/j.cell.2021.04.004 [DOI] [PMC free article] [PubMed] [Google Scholar]
  165. Moctar A. O. M., Sarr I., Tanzouak J. V. (2019). Snapshot setting for temporal networks analysis. Springer, 98. [Google Scholar]
  166. Mucha P. J., Richardson T., Macon K., Porter M. A., Onnela J.-P. (2010). Community structure in time-dependent, multiscale, and multiplex networks. Science. 328, 876–878. 10.1126/science.1184819 [DOI] [PubMed] [Google Scholar]
  167. Neapolitan R. E. (2004). Learning bayesian networks. Upper Saddle River, NJ: Pearson Prentice Hall. [Google Scholar]
  168. Newaz K., Milenković T. (2020). Inference of a dynamic aging-related biological subnetwork via network propagation. IEEE/ACM Trans. Comput. Biol. Bioinform 19, 974–988. 10.1109/TCBB.2020.3022767 [DOI] [PubMed] [Google Scholar]
  169. Newman M. E. (2001). The structure of scientific collaboration networks. Proc. Natl. Acad. Sci. 98, 404–409. 10.1073/pnas.021544898 [DOI] [PMC free article] [PubMed] [Google Scholar]
  170. Newman M. E. (2006). Modularity and community structure in networks. Proc. Natl. Acad. Sci. 103, 8577–8582. 10.1073/pnas.0601602103 [DOI] [PMC free article] [PubMed] [Google Scholar]
  171. Newman M. (2018). Networks. Oxford University Press. [Google Scholar]
  172. Newman M. E., Girvan M. (2004). Finding and evaluating community structure in networks. Phys. Rev. E 69, 026113. 10.1103/PhysRevE.69.026113 [DOI] [PubMed] [Google Scholar]
  173. Nguyen G. H., Lee J. B., Rossi R. A., Ahmed N. K., Koh E., Kim S. (2018). Continuous-time dynamic network embeddings, 969–976. [Google Scholar]
  174. Nguyen T., Nguyen G. T., Nguyen T., Le D.-H. (2021). Graph convolutional networks for drug response prediction. IEEE/ACM Trans. Comput. Biol. Bioinform 19, 146–154. 10.1109/tcbb.2021.3060430 [DOI] [PubMed] [Google Scholar]
  175. Ni C.-C., Lin Y.-Y., Luo F., Gao J. (2019). Community detection on networks with ricci flow. Sci. Rep. 9, 9984. 10.1038/s41598-019-46380-9 [DOI] [PMC free article] [PubMed] [Google Scholar]
  176. Nooren I. M., Thornton J. M. (2003). Diversity of protein–protein interactions. EMBO J. 22, 3486–3492. 10.1093/emboj/cdg359 [DOI] [PMC free article] [PubMed] [Google Scholar]
  177. Oates C. J., Mukherjee S. (2012). Network inference and biological dynamics. Ann. Appl. Stat. 6, 1209–1235. 10.1214/11-AOAS532 [DOI] [PMC free article] [PubMed] [Google Scholar]
  178. Olivella S., Pratt T., Imai K. (2022). Dynamic stochastic blockmodel regression for network data: application to international militarized conflicts. J. Am. Stat. Assoc. 117, 1068–1081. 10.1080/01621459.2021.2024436 [DOI] [Google Scholar]
  179. Padi M., Quackenbush J. (2015). Integrating transcriptional and protein interaction networks to prioritize condition-specific master regulators. BMC Syst. Biol. 9, 80. 10.1186/s12918-015-0228-1 [DOI] [PMC free article] [PubMed] [Google Scholar]
  180. Padi M., Quackenbush J. (2018). Detecting phenotype-driven transitions in regulatory network structure. NPJ Syst. Biol. Appl. 4, 16. 10.1038/s41540-018-0052-5 [DOI] [PMC free article] [PubMed] [Google Scholar]
  181. Palazzi Nieves M. J., Borge-Holthoefer J., Tessone C. J., Solé-Ribalta A. (2019). Macro-and mesoscale pattern interdependencies in complex networks. J. R. Soc. Interface 16, 2019. 10.1098/rsif.2019.0553 [DOI] [PMC free article] [PubMed] [Google Scholar]
  182. Palla G., Derényi I., Farkas I., Vicsek T. (2005). Uncovering the overlapping community structure of complex networks in nature and society. Nature 435, 814–818. 10.1038/nature03607 [DOI] [PubMed] [Google Scholar]
  183. Palla G., Barabási A.-L., Vicsek T. (2007). Quantifying social group evolution. Nature 446, 664–667. 10.1038/nature05670 [DOI] [PubMed] [Google Scholar]
  184. Palsson B. Ø. (2011). Systems biology: simulation of dynamic network states. Cambridge University Press. [Google Scholar]
  185. Pan Z., Li L., Fang Q., Zhang Y., Hu X., Qian Y., et al. (2018). Analysis of dynamic molecular networks for pancreatic ductal adenocarcinoma progression. Cancer Cell Int. 18, 1–18. 10.1186/s12935-018-0718-5 [DOI] [PMC free article] [PubMed] [Google Scholar]
  186. Pang K., Sheng H., Ma X. (2010). Understanding gene essentiality by finely characterizing hubs in the yeast protein interaction network. Biochem. Biophys. Res. Commun. 401, 112–116. 10.1016/j.bbrc.2010.09.021 [DOI] [PubMed] [Google Scholar]
  187. Paranjape A., Benson A. R., Leskovec J. (2017). Motifs in temporal networks, 601–610. [Google Scholar]
  188. Passos N. A., Carlini E., Trani S. (2025). NetworkX-Temporal: building, manipulating, and analyzing dynamic graph structures. SoftwareX 31, 102277. 10.1016/j.softx.2025.102277 [DOI] [Google Scholar]
  189. Pedreschi N., Battaglia D., Barrat A. (2022). The temporal rich club phenomenon. Nat. Phys. 18, 931–938. 10.1038/s41567-022-01634-8 [DOI] [Google Scholar]
  190. Peixoto T. P., Rosvall M. (2017). Modelling sequences and temporal networks with dynamic community structures. Nat. Commun. 8, 582. 10.1038/s41467-017-00148-9 [DOI] [PMC free article] [PubMed] [Google Scholar]
  191. Perozzi B., Al-Rfou R., Skiena S. (2014). Deepwalk: online learning of social representations, 701–710. [Google Scholar]
  192. Pfitzner R., Scholtes I., Garas A., Tessone C. J., Schweitzer F. (2013). Betweenness preference: quantifying correlations in the topological dynamics of temporal networks. Phys. Rev. Lett. 110, 198701. 10.1103/PhysRevLett.110.198701 [DOI] [PubMed] [Google Scholar]
  193. Porter M. A., Onnela J.-P., Mucha P. J. (2009). Communities in networks. [Google Scholar]
  194. Pratapa A., Jalihal A. P., Law J. N., Bharadwaj A., Murali T. (2020). Benchmarking algorithms for gene regulatory network inference from single-cell transcriptomic data. Nat. Methods. 17, 147–154. 10.1038/s41592-019-0690-6 [DOI] [PMC free article] [PubMed] [Google Scholar]
  195. Quach M., Brunel N., d’Alché-Buc F. (2007). Estimating parameters and hidden variables in non-linear state-space models based on ODEs for biological networks inference. Bioinformatics 23, 3209–3216. 10.1093/bioinformatics/btm510 [DOI] [PubMed] [Google Scholar]
  196. Quesada D., Larrañaga P., Bielza C. (2025). dbnR: gaussian dynamic bayesian network learning and inference in R. J. Stat. Softw. 115, 1–35. 10.18637/jss.v115.i06 [DOI] [Google Scholar]
  197. Radicchi F., Castellano C., Cecconi F., Loreto V., Parisi D. (2004). Defining and identifying communities in networks. Proc. Natl. Acad. Sci. 101, 2658–2663. 10.1073/pnas.0400054101 [DOI] [PMC free article] [PubMed] [Google Scholar]
  198. Rajaguru G., Lim S., O’Neill M. (2025). A review of temporal aggregation and systematic sampling on time-series analysis. J. Acc. Lit. 47, 110–128. 10.1108/jal-09-2024-0237 [DOI] [Google Scholar]
  199. Rajendra P., Brahmajirao V. (2020). Modeling of dynamical systems through deep learning. Biophys. Rev. 12, 1311–1320. 10.1007/s12551-020-00776-4 [DOI] [PMC free article] [PubMed] [Google Scholar]
  200. Rohrschneider M., Ullrich A., Kerren A., Stadler P. F., Scheuermann G. (2010). Visual network analysis of dynamic metabolic pathways. Springer, 316–327. [Google Scholar]
  201. Rossi R. A., Gallagher B., Neville J., Henderson K. (2013). Modeling dynamic behavior in large evolving graphs, 667–676. [Google Scholar]
  202. Rozemberczki B., Scherer P., He Y., Panagopoulos G., Riedel A., Astefanoaei M., et al. (2021). Pytorch geometric temporal: spatiotemporal signal processing with neural machine learning models, 4564–4573. [Google Scholar]
  203. Shmulevich I., Dougherty E. R., Zhang W. (2002). From boolean to probabilistic boolean networks as models of genetic regulatory networks. Proc. IEEE 90, 1778–1792. 10.1109/jproc.2002.804686 [DOI] [Google Scholar]
  204. Sachs K., Perez O., Pe’er D., Lauffenburger D. A., Nolan G. P. (2005). Causal protein-signaling networks derived from multiparameter single-cell data. Science 308, 523–529. 10.1126/science.1105809 [DOI] [PubMed] [Google Scholar]
  205. Saelens W., Cannoodt R., Todorov H., Saeys Y. (2019). A comparison of single-cell trajectory inference methods. Nat. Biotechnol. 37, 547–554. 10.1038/s41587-019-0071-9 [DOI] [PubMed] [Google Scholar]
  206. Safari-Alighiarloo N., Taghizadeh M., Rezaei-Tavirani M., Goliaei B., Peyvandi A. A. (2014). Protein-protein interaction networks (PPI) and complex diseases. Gastroenterol. Hepatol. Bed Bench. 7, 17–31. [PMC free article] [PubMed] [Google Scholar]
  207. Sanches P. H. G., de Melo N. C., Porcari A. M., de Carvalho L. M. (2024). Integrating molecular perspectives: strategies for comprehensive multi-omics integrative data analysis and machine learning applications in transcriptomics, proteomics, and metabolomics. Biology 13, 848. 10.3390/biology13110848 [DOI] [PMC free article] [PubMed] [Google Scholar]
  208. Saqr M. (2023). Temporal network analysis: introduction, methods and detailed tutorial with R. ArXiv prepr ArXiv230712339. [Google Scholar]
  209. Saqr M. (2024). Temporal network analysis: introduction, methods and analysis with R. Learning analytics methods and tutorials: a practical guide using R. Springer, 541–567. [Google Scholar]
  210. Schlossarek D., Luzarowski M., Sokołowska E. M., Thirumalaikumar V. P., Dengler L., Willmitzer L., et al. (2022). Rewiring of the protein–protein–metabolite interactome during the diauxic shift in yeast. Cell Mol. Life Sci. 79, 550. 10.1007/s00018-022-04569-8 [DOI] [PMC free article] [PubMed] [Google Scholar]
  211. Scholtes I., Wider N., Garas A. (2016). Higher-order aggregate networks in the analysis of temporal networks: path structures and centralities. Eur. Phys. J. B 89, 1–15. 10.1140/epjb/e2016-60663-0 [DOI] [Google Scholar]
  212. Sevimoglu T., Arga K. Y. (2014). The role of protein interaction networks in systems biomedicine. Comput. Struct. Biotechnol. J. 11, 22–27. 10.1016/j.csbj.2014.08.008 [DOI] [PMC free article] [PubMed] [Google Scholar]
  213. Shakil S., Lee C.-H., Keilholz S. D. (2016). Evaluation of sliding window correlation performance for characterizing dynamic functional connectivity and brain states. Neuroimage 133, 111–128. 10.1016/j.neuroimage.2016.02.074 [DOI] [PMC free article] [PubMed] [Google Scholar]
  214. Sharma R., Kumar S., Song M. (2021). Fundamental gene network rewiring at the second order within and across mammalian systems. Bioinformatics 37, 3293–3301. 10.1093/bioinformatics/btab240 [DOI] [PubMed] [Google Scholar]
  215. Sherwani M. K., Ruuskanen M. O., Feldner-Busztin D., Nisantzis Firbas P., Boza G., Móréh Á., et al. (2025). Multi-omics time-series analysis in microbiome research: a systematic review. Brief. Bioinform 26, bbaf502. 10.1093/bib/bbaf502 [DOI] [PMC free article] [PubMed] [Google Scholar]
  216. Sheu K. M., Hoffmann A. (2022). Functional hallmarks of healthy macrophage responses: their regulatory basis and disease relevance. Annu. Rev. Immunol. 40, 295–321. 10.1146/annurev-immunol-101320-031555 [DOI] [PMC free article] [PubMed] [Google Scholar]
  217. Shojaie A. (2021). Differential network analysis: a statistical perspective. Wiley Interdiscip. Rev. Comput. Stat. 13, e1508. 10.1002/wics.1508 [DOI] [PMC free article] [PubMed] [Google Scholar]
  218. Siglidis G., Nikolentzos G., Limnios S., Giatsidis C., Skianis K., Vazirgiannis M. (2020). Grakel: a graph kernel library in python. J. Mach. Learn Res. 21, 1–5. 34305477 [Google Scholar]
  219. Sikdar S., Ganguly N., Mukherjee A. (2016). Time series analysis of temporal networks. Eur. Phys. J. B 89, 1–11. 10.1140/epjb/e2015-60654-7 [DOI] [Google Scholar]
  220. Singer P., Helic D., Taraghi B., Strohmaier M. (2014). Detecting memory and structure in human navigation patterns using markov chain models of varying order. PloS One 9, e102070. 10.1371/journal.pone.0102070 [DOI] [PMC free article] [PubMed] [Google Scholar]
  221. Singh R., Xu J., Berger B. (2008). Global alignment of multiple protein interaction networks with application to functional orthology detection. Proc. Natl. Acad. Sci. 105, 12763–12768. 10.1073/pnas.0806627105 [DOI] [PMC free article] [PubMed] [Google Scholar]
  222. Škrlj B., Kralj J., Lavrač N. (2019). Py3plex toolkit for visualization and analysis of multilayer networks. Appl. Netw. Sci. 4, 94. 10.1007/s41109-019-0203-7 [DOI] [Google Scholar]
  223. Smiljanić J., Edler D., Rosvall M. (2020). Mapping flows on sparse networks with missing links. Phys. Rev. E 102, 012302. 10.1103/PhysRevE.102.012302 [DOI] [PubMed] [Google Scholar]
  224. Song D., Li J. J. (2021). PseudotimeDE: inference of differential gene expression along cell pseudotime with well-calibrated p-values from single-cell RNA sequencing data. Genome Biol. 22, 124. 10.1186/s13059-021-02341-y [DOI] [PMC free article] [PubMed] [Google Scholar]
  225. Stacey R. G., Skinnider M. A., Chik J. H., Foster L. J. (2018). Context-specific interactions in literature-curated protein interaction databases. BMC Genomics 19, 758. 10.1186/s12864-018-5139-2 [DOI] [PMC free article] [PubMed] [Google Scholar]
  226. Stegle O., Denby K. J., Cooke E. J., Wild D. L., Ghahramani Z., Borgwardt K. M. (2010). A robust Bayesian two-sample test for detecting intervals of differential gene expression in microarray time series. J. Comput. Biol. 17, 355–367. 10.1089/cmb.2009.0175 [DOI] [PMC free article] [PubMed] [Google Scholar]
  227. Stock M., Losert C., Zambon M., Popp N., Lubatti G., Hörmanseder E., et al. (2025). Leveraging prior knowledge to infer gene regulatory networks from single-cell rna-sequencing data. Mol. Syst. Biol. 21, 214–230. 10.1038/s44320-025-00088-3 [DOI] [PMC free article] [PubMed] [Google Scholar]
  228. Street K., Risso D., Fletcher R. B., Das D., Ngai J., Yosef N., et al. (2018). Slingshot: cell lineage and pseudotime inference for single-cell transcriptomics. BMC Genomics 19, 477. 10.1186/s12864-018-4772-0 [DOI] [PMC free article] [PubMed] [Google Scholar]
  229. Subramanian I., Verma S., Kumar S., Jere A., Anamika K. (2020). Multi-omics data integration, interpretation, and its application. Bioinforma. Biol. Insights 14, 1177932219899051. 10.1177/1177932219899051 [DOI] [PMC free article] [PubMed] [Google Scholar]
  230. Sulo R., Berger-Wolf T., Grossman R. (2010). Meaningful selection of temporal resolution for dynamic networks, 127–136. [Google Scholar]
  231. Sun Q., Wang W. (2019). Structures of BRAF–MEK1–14-3-3 sheds light on drug discovery. Signal Transduct. Target Ther. 4, 59. 10.1038/s41392-019-0096-z [DOI] [PMC free article] [PubMed] [Google Scholar]
  232. Šverko Z., Vrankic M., Vlahinić S., Rogelj P. (2022). Dynamic connectivity analysis using adaptive window size. Sensors 22, 5162. 10.3390/s22145162 [DOI] [PMC free article] [PubMed] [Google Scholar]
  233. Tejada-Lapuerta A., Bertin P., Bauer S., Aliee H., Bengio Y., Theis F. J. (2025). Causal machine learning for single-cell genomics. Nat. Genet. 57, 1–12. 10.1038/s41588-025-02124-2 [DOI] [PubMed] [Google Scholar]
  234. Thompson W. H., Brantefors P., Fransson P. (2017). From static to temporal network theory: applications to functional brain connectivity. Netw. Neurosci. 1, 69–99. 10.1162/NETN_a_00011 [DOI] [PMC free article] [PubMed] [Google Scholar]
  235. Tripathy R. K., Frohock Z., Wang H., Cary G. A., Keegan S., Carter G. W., et al. (2025). Effective integration of multi-omics with prior knowledge to identify biomarkers via explainable graph neural networks. Npj Syst. Biol. Appl. 11, 43. 10.1038/s41540-025-00519-9 [DOI] [PMC free article] [PubMed] [Google Scholar]
  236. Tritschler S., Büttner M., Fischer D. S., Lange M., Bergen V., Lickert H., et al. (2019). Concepts and limitations for learning developmental trajectories from single cell genomics. Development 146, dev170506. 10.1242/dev.170506 [DOI] [PubMed] [Google Scholar]
  237. Tsalouchidou I., Baeza-Yates R., Bonchi F., Liao K., Sellis T. (2020). Temporal betweenness centrality in dynamic graphs. Int. J. Data Sci. Anal. 9, 257–272. 10.1007/s41060-019-00189-x [DOI] [Google Scholar]
  238. Tu B. P., Kudlicki A., Rowicka M., McKnight S. L. (2005). Logic of the yeast metabolic cycle: temporal compartmentalization of cellular processes. Science. 310, 1152–1158. 10.1126/science.1120499 [DOI] [PubMed] [Google Scholar]
  239. Upadhyaya Y., Xie L., Salama P., Cao S., Nho K., Saykin A. J., et al. (2020). Differential co-expression analysis reveals early stage transcriptomic decoupling in alzheimer’s disease. BMC Med. Genomics 13, 53. 10.1186/s12920-020-0689-y [DOI] [PMC free article] [PubMed] [Google Scholar]
  240. Valentini G., Paccanaro A., Caniza H., Romero A. E., Re M. (2014). An extensive analysis of disease-gene associations using network integration and fast kernel-based gene prioritization methods. Artif. Intell. Med. 61, 63–78. 10.1016/j.artmed.2014.03.003 [DOI] [PMC free article] [PubMed] [Google Scholar]
  241. Van Dam S., Vosa U., Van der Graaf A., Franke L., de Magalhaes J. P. (2018). Gene co-expression analysis for functional classification and gene–disease predictions. Brief. Bioinform 19, 575–592. 10.1093/bib/bbw139 [DOI] [PMC free article] [PubMed] [Google Scholar]
  242. Van Der Wijst M. G., de Vries D. H., Brugge H., Westra H.-J., Franke L. (2018). An integrative approach for building personalized gene regulatory networks for precision medicine. Genome Med. 10, 1–15. 10.1186/s13073-018-0608-4 [DOI] [PMC free article] [PubMed] [Google Scholar]
  243. Vogelstein B., Lane D., Levine A. J. (2000). Surfing the p53 network. Nature 408, 307–310. 10.1038/35042675 [DOI] [PubMed] [Google Scholar]
  244. Wade P. R. (2000). Bayesian methods in conservation biology. Conserv. Biol. 14, 1308–1316. 10.1046/j.1523-1739.2000.99415.x [DOI] [Google Scholar]
  245. Wang Y., Yao Y., Tong H., Xu F., Lu J. (2018). A brief review of network embedding. Big Data Min. Anal. 2, 35–47. 10.26599/bdma.2018.9020029 [DOI] [Google Scholar]
  246. Weinstock J. S., Arce M. M., Freimer J. W., Ota M., Marson A., Battle A., et al. (2024). Gene regulatory network inference from CRISPR perturbations in primary CD4+ T cells elucidates the genomic basis of immune disease. Cell Genomics 4, 100671. 10.1016/j.xgen.2024.100671 [DOI] [PMC free article] [PubMed] [Google Scholar]
  247. Wu H., Cheng J., Huang S., Ke Y., Lu Y., Xu Y. (2014). Path problems in temporal graphs. Proc. VLDB Endow. 7, 721–732. 10.14778/2732939.2732945 [DOI] [Google Scholar]
  248. Wu S., Zhang S., Liu C.-M., Fernie A. R., Yan S. (2024). Recent advances in mass spectrometry-based protein interactome studies. Mol. Cell Proteomics 24, 100887. 10.1016/j.mcpro.2024.100887 [DOI] [PMC free article] [PubMed] [Google Scholar]
  249. Wu Y., Chen M., Qin Y. (2025). Anticancer drug response prediction integrating multi-omics pathway-based difference features and multiple deep learning techniques. PLOS Comput. Biol. 21, e1012905. 10.1371/journal.pcbi.1012905 [DOI] [PMC free article] [PubMed] [Google Scholar]
  250. Xie J., Yang F., Wang J., Karikomi M., Yin Y., Sun J., et al. (2020). DNF: a differential network flow method to identify rewiring drivers for gene regulatory networks. Neurocomputing 410, 202–210. 10.1016/j.neucom.2020.05.028 [DOI] [PMC free article] [PubMed] [Google Scholar]
  251. Xu K. S., Hero I. I. I. A. O. (2013). Dynamic stochastic blockmodels: statistical models for time-evolving networks. Springer, 201–210. [Google Scholar]
  252. Xu K. S., Hero A. O. (2014). Dynamic stochastic blockmodels for time-evolving social networks. IEEE J. Sel. Top. Signal Process 8, 552–562. 10.1109/jstsp.2014.2310294 [DOI] [Google Scholar]
  253. Yan H., Weng D., Li D., Gu Y., Ma W., Liu Q. (2024). Prior knowledge-guided multilevel graph neural network for tumor risk prediction and interpretation via multi-omics data integration. Brief. Bioinform 25, bbae184. 10.1093/bib/bbae184 [DOI] [PMC free article] [PubMed] [Google Scholar]
  254. Yook S.-H., Jeong H., Barabási A.-L., Tu Y. (2001). Weighted evolving networks. Phys. Rev. Lett. 86, 5835–5838. 10.1103/PhysRevLett.86.5835 [DOI] [PubMed] [Google Scholar]
  255. Yu T. (2018). A new dynamic correlation algorithm reveals novel functional aspects in single cell and bulk RNA-Seq data. PLoS Comput. Biol. 14, e1006391. 10.1371/journal.pcbi.1006391 [DOI] [PMC free article] [PubMed] [Google Scholar]
  256. Yu W., Aggarwal C. C., Wang W. (2017). Temporally factorized network modeling for evolutionary network analysis, 455–464. [DOI] [PMC free article] [PubMed] [Google Scholar]
  257. Yu E.-Y., Fu Y., Chen X., Xie M., Chen D.-B. (2020). Identifying critical nodes in temporal networks by network embedding. Sci. Rep. 10, 12494. 10.1038/s41598-020-69379-z [DOI] [PMC free article] [PubMed] [Google Scholar]
  258. Yuan Q., Duren Z. (2025). Inferring gene regulatory networks from single-cell multiome data using atlas-scale external data. Nat. Biotechnol. 43, 247–257. 10.1038/s41587-024-02182-7 [DOI] [PMC free article] [PubMed] [Google Scholar]
  259. Yuan J., Ofengeim D. (2024). A guide to cell death pathways. Nat. Rev. Mol. Cell Biol. 25, 379–395. 10.1038/s41580-023-00689-6 [DOI] [PubMed] [Google Scholar]
  260. Zaoli S., Mazzarisi P., Lillo F. (2021). Betweenness centrality for temporal multiplexes. Sci. Rep. 11, 4919. 10.1038/s41598-021-84418-z [DOI] [PMC free article] [PubMed] [Google Scholar]
  261. Zhang A. (2009). Protein interaction networks: computational analysis. Cambridge University Press. [Google Scholar]
  262. Zhang J., Liu J., Lee D., Lou S., Chen Z., Gürsoy G., et al. (2020). DiNeR: a Di fferential graphical model for analysis of co-regulation Ne twork R ewiring. BMC Bioinforma. 21, 281. 10.1186/s12859-020-03605-3 [DOI] [PMC free article] [PubMed] [Google Scholar]
  263. Zhang X.-M., Liang L., Liu L., Tang M.-J. (2021). Graph neural networks and their current applications in bioinformatics. Front. Genet. 12, 690049. 10.3389/fgene.2021.690049 [DOI] [PMC free article] [PubMed] [Google Scholar]
  264. Zhang P., Gember-Jacobson A., Zuo Y., Huang Y., Liu X., Li H. (2022). Differential network analysis, 601–615. [Google Scholar]
  265. Zhao W., Larschan E., Sandstede B., Singh R. (2025). Optimal transport reveals dynamic gene regulatory networks via gene velocity estimation. PLOS Comput. Biol. 21, e1012476. 10.1371/journal.pcbi.1012476 [DOI] [PMC free article] [PubMed] [Google Scholar]
  266. Zhong L., Li Y., Xiong L., Wang W., Wu M., Yuan T., et al. (2021). Small molecules in targeted cancer therapy: advances, challenges, and future perspectives. Signal Transduct. Target Ther. 6, 201. 10.1038/s41392-021-00572-w [DOI] [PMC free article] [PubMed] [Google Scholar]
  267. Zhong S., Zhang H., Deng Y. (2022). Identification of influential nodes in complex networks: a local degree dimension approach. Inf. Sci. 610, 994–1009. 10.1016/j.ins.2022.07.172 [DOI] [Google Scholar]
  268. Zitnik M., Li M. M., Wells A., Glass K., Morselli Gysi D., Krishnan A., et al. (2024). Current and future directions in network biology. Bioinforma. Adv. 4, vbae099. 10.1093/bioadv/vbae099 [DOI] [PMC free article] [PubMed] [Google Scholar]

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Supplementary Materials

DataSheet1.pdf (2.3MB, pdf)

Articles from Frontiers in Bioinformatics are provided here courtesy of Frontiers Media SA

RESOURCES