The core problem the team set out to solve is one of biological interpretation. Standard trajectory inference methods frequently produce trees with multifurcations, meaning nodes where three, four, or more branches radiate from a single point. Mathematically, such high-degree branching is often the cheapest way to connect all the cells in a dataset, which is why minimum spanning tree approaches favor it. Biologically, however, a node with five simultaneous outgoing branches is hard to defend. Cell fate decisions, as conceptualized in Waddington’s famous epigenetic landscape, are typically depicted as a ball rolling down a valley that splits into two channels, not five. A binary structure, where each decision point offers at most two alternatives, aligns far more naturally with this classical picture of progressive restriction of cell potential.

To impose this binary discipline, the researchers turned to integer programming, a branch of discrete optimization in which decisions are encoded as variables restricted to whole-number values. In their formulation, the choice of which edges to include in the spanning tree becomes a set of binary variables, each indicating whether a particular connection between two cell cluster representatives is selected. The objective function minimizes the total edge weight, preserving the spirit of the minimum spanning tree, while additional constraints enforce that no node in the resulting tree exceeds a degree of two in the branching sense appropriate for trajectory topology. This transforms a problem that classical greedy algorithms such as Kruskal’s or Prim’s can solve efficiently into a harder combinatorial optimization problem, but one whose solutions carry direct biological meaning.

The degree restriction is not merely cosmetic. When an unconstrained minimum spanning tree is built over cluster centroids in a high-dimensional gene expression space, the algorithm has no incentive to respect the sequential nature of cell differentiation. It may connect a mature cell type directly to a primitive progenitor population through a shortcut that skips intermediate states, or it may hang several distinct lineages off a single hub. By capping the degree, the integer programming formulation forces the tree to route connections through intermediate nodes, producing a hierarchy in which each branching event represents a discrete, interpretable fate choice. The result is a topology that reads like a family tree of cell states rather than a tangled web of shortest connections.

A key practical strength of the new method is its modularity. Rather than building a complete trajectory pipeline from scratch, the authors implemented their degree-restricted tree construction as a plug-in module that can be inserted into existing graph-based and tree-based trajectory inference frameworks. To demonstrate this flexibility, they integrated the module into Slingshot, one of the most widely used pseudotime inference tools in the single-cell genomics community. Slingshot traditionally constructs a minimum spanning tree over cluster centroids and then fits principal curves along its branches to order cells in pseudotime. By swapping the unconstrained tree for the degree-restricted one, the researchers showed that the downstream pseudotime machinery can operate on a topology that is simultaneously cost-efficient and biologically constrained.

Validation of the constrained topologies required an independent reference against which the reconstructed trees could be compared. The team turned to CoSpar, a method that infers cell fate hierarchies using lineage information, often derived from experimental lineage tracing. By evaluating the consistency of their degree-restricted trees against a CoSpar-derived reference hierarchy, the authors could assess whether the binary constraint, imposed purely on the basis of expression data and optimization, recovered relationships that an orthogonal lineage-aware approach also supports. This cross-method consistency check is important because trajectory inference is notoriously sensitive to the assumptions baked into any single algorithm, and agreement between structurally different approaches lends credibility to the inferred hierarchy.

The researchers applied their framework to three biologically rich datasets: bone marrow mononuclear cells, human fetal immune cells, and a mouse hematopoiesis dataset. Hematopoiesis, the process by which blood cells are generated, is a canonical testing ground for trajectory methods because its branching structure, from stem cells through progenitors to mature lineages, has been mapped in detail over decades of experimental work. Across these datasets, the degree-restricted trees produced trajectories whose branching patterns were more interpretable than those generated by unconstrained minimum spanning tree baselines. The comparison with the unconstrained baselines was descriptive rather than a claim of universal superiority, but it illustrated concretely how the binary constraint reshapes the inferred lineage structure into forms that match developmental expectations.

Behind the biological narrative lies a substantial computational challenge. Minimum spanning trees can be computed in near-linear time for the number of edges considered, but degree-constrained spanning tree problems belong to a family of combinatorial optimization problems that are computationally hard in general. Integer programming solvers handle such problems by exploring the space of feasible integer solutions with techniques such as branch and bound, cutting planes, and linear programming relaxations. The feasibility of the approach at the scale of single-cell datasets, where cluster-level graphs may contain dozens to hundreds of nodes after preprocessing and clustering, depends on careful formulation that keeps the integer program tractable. The authors’ decision to operate at the level of cluster representatives rather than individual cells is central to this tractability, since it dramatically reduces the number of nodes over which the constrained tree must be built.

The conceptual appeal of the method extends beyond hematopoiesis. Waddington’s epigenetic landscape, sketched in the 1950s as a metaphor for how cells navigate a landscape of developmental potential, has become a guiding intuition for the entire field of pseudotime analysis. Yet most computational implementations of trajectory inference treat topology as an emergent property of the data rather than an explicit modeling choice. By encoding the binary branching structure directly into the optimization objective and constraints, the new approach makes the Waddingtonian assumption a formal part of the inference procedure. This explicitness is a virtue: it allows users to see exactly what biological prior is being imposed, and it opens the door to future variants in which different degree restrictions or additional structural constraints could encode other hypotheses about how cell states relate.

The work, led by Jiaying Zhao and Takuma Iwaki, who contributed equally, together with Tomoya Mori, Wai-Ki Ching, and Tatsuya Akutsu, was supported by the Hong Kong Research Grants Council and released as open access, with source code publicly available on GitHub for researchers who wish to integrate the degree-restricted module into their own pipelines. As single-cell RNA sequencing continues to generate atlases of ever greater scale and complexity, the demand for trajectory inference methods that are both computationally principled and biologically legible will only grow. This study demonstrates that ideas from discrete optimization, a field seemingly distant from developmental biology, can supply exactly the kind of structural discipline that turns a tangle of gene expression similarities into a readable map of cellular destiny.

Subject of Research: Degree-restricted minimum spanning tree algorithms for binary cell trajectory inference in single-cell RNA-seq data

Article Title: Degree-restricted minimum spanning trees for binary cell trajectory inference in single-cell RNA-seq data

Article References: Zhao, J., Iwaki, T., Mori, T., Ching, W.-K., & Akutsu, T. (2026). Degree-restricted minimum spanning trees for binary cell trajectory inference in single-cell RNA-seq data. BMC Bioinformatics. https://doi.org/10.1186/s12859-026-06674-y

Image Credits: AI Generated

DOI: 10.1186/s12859-026-06674-y

Keywords: single-cell RNA-seq, trajectory inference, pseudotime, minimum spanning tree, integer programming, Waddington's epigenetic landscape, hematopoiesis, Slingshot, CoSpar, cell fate decisions, computational biology, discrete optimization

The core insight of the paper is architectural. Rather than treating forecasting and optimization as two sequential stages that are calibrated once and then left alone, the authors construct a closed-loop system in which the two components continuously inform and correct each other. At the foundation sits a unified representation and pre-processing layer that normalizes multi-source sensor data into a consistent form. From there, a time series prediction model projects forward the values of crucial state variables, and those predicted parameters are handed directly to linear programming and integer programming optimization models. The optimizers then construct the best possible decision scheme subject to the various operational constraints that real IoT environments impose, from energy budgets to task deadlines.

What distinguishes this framework from the conventional static paradigm, in which a prediction model feeds an optimizer and the output is accepted as final, is its rolling-horizon prediction-optimization-feedback mechanism. In the classical approach, any drift in the underlying data, a sudden change in load, a failing sensor, a shift in user behavior, silently degrades both the forecast and the plan built upon it. The new system instead uses the execution feedback generated by adaptive optimization to update the reconstructed input sequence and the optimization parameter states on a rolling basis. Each cycle of execution produces fresh evidence about how well the last decision performed, and that evidence flows back into the prediction model, which in turn feeds a revised plan to the optimizer. The result is a prediction-optimization-feedback loop that achieves rolling optimization and continuous model iteration rather than one-shot planning.

The reported numbers give a concrete sense of how the system performs. In the authors’ evaluation, the normalized load prediction achieved a root mean square error of 0.087, a figure that indicates the forecasting component tracked demand closely even as conditions varied. The optimal decision scheme produced by the optimization layer summed to a total expense of 1.24 multiplied by ten to the relevant power in monetary units, with an energy consumption index of 3.56 multiplied by ten kilowatt-hours. Task completion reached 98.7 percent, and the system decision error converged to approximately 0.063 during the closed-loop iteration process. Those last two figures matter most in practice: high task completion with low decision error suggests the feedback loop is doing exactly what it was designed to do, namely catching and correcting errors before they compound.

Benchmarking is where the study stakes its claim. The authors compared their framework against three recent benchmark methods and report that the proposed approach obtained lower prediction error, lower operating expense and higher stability of the decision. Stability is a metric that is easy to overlook but critical for IoT operators, because a decision system that oscillates between wildly different plans, even if each plan looks good on paper, creates churn that ripples through scheduling, provisioning and maintenance. A closed-loop design that smooths those oscillations by continuously reconciling predictions with observed outcomes offers a more dependable foundation for systems that must run unattended for long periods.

The significance of this work extends beyond any single deployment. IoT systems now underpin smart city traffic management, sustainable supply chains, industrial automation, environmental monitoring and precision agriculture, and in each of these domains the same structural problem recurs: sensor data arrives with mobility and uncertainty, predictions go stale quickly, and decisions made on stale predictions waste energy, money or both. The literature the authors survey reflects a field that has attacked these problems piecemeal, with deep learning time series forecasting on one side and optimization-driven resource allocation, fog-cloud offloading and Lyapunov-based control on the other. By arguing for the deep integration and mutual evolution of machine learning and operations research, the paper positions itself as a template for how those two threads can be woven into a single adaptive architecture.

Technically, the choice of linear and integer programming as the optimization backbone is worth unpacking. Linear programming handles continuous allocation problems, such as distributing computational load or energy across devices, where resources can be divided fractionally. Integer programming handles the discrete decisions that pervade IoT orchestration, such as whether a task is assigned to a particular edge node or deferred entirely. Because both formulations accept the predicted forward parameters of state variables as inputs, the prediction model effectively parameterizes the optimization problem in real time. This is what makes the coupling tight: the optimizer is not working from a static estimate of demand but from a forecast that is itself being retrained and corrected by the outcomes of previous optimization rounds.

The rolling-horizon mechanism also echoes a long tradition in control theory and operations research, where receding-horizon control has proven effective for systems that must be steered under uncertainty. What the authors add is the explicit feedback of execution results into the reconstructed input sequence of the learning model, closing the loop in a way that makes the entire pipeline self-correcting. In effect, the system treats every decision as an experiment whose outcome refines the next forecast. Over successive iterations, the decision error reported in the study settles toward its low value, which the authors interpret as evidence that the collaborative mechanism between prediction and optimization converges rather than destabilizes.

The authors are careful to frame their contribution as both theoretical and architectural. They write that the paper reveals the universality of the deep integration and mutual evolution of machine learning and operations research, and that the framework provides theoretical support and scalable architecture modes for building stable and adaptive intelligent decision-making systems for complex IoT environments. Scalability is the operative word: because the pre-processing layer unifies multi-source data and the loop structure is agnostic to the specific prediction or optimization algorithms plugged into it, the design could in principle be adapted to settings ranging from smart grids to logistics networks without redesigning the fundamental control structure.

For practitioners, the study offers a pragmatic lesson: the next generation of IoT intelligence will likely come less from ever-larger forecasting models and more from the discipline of how predictions, optimizations and real-world feedback are wired together. As billions of devices continue to join the network, the systems that manage them will need to make thousands of small decisions per second under uncertainty, and a closed-loop architecture that learns from its own choices, as demonstrated by Shen and colleagues, points toward a future in which prediction and optimization are no longer separate stages but a single, continuously evolving decision engine. The research, published in the special issue on Machine Learning and Big Data Analytics for IoT Security and Privacy, arrived online on 30 September 2026 as volume 38, article 760 of the journal.

Subject of Research: A closed-loop intelligent decision-making framework integrating machine learning prediction and operations research optimization for Internet of Things systems

Article Title: Intelligent decision-making system combining machine learning and operations research models in Internet of Things systems

Article References: Shen, Q., Yang, C., Bai, W., & Wang, C. (2026). Intelligent decision-making system combining machine learning and operations research models in Internet of Things systems. Neural Computing and Applications, 38(19), Article 760. https://doi.org/10.1007/s00521-026-12461-w

Image Credits: AI Generated

DOI: 10.1007/s00521-026-12461-w

Keywords: Internet of Things, machine learning, operations research, closed-loop decision-making, rolling horizon control, linear programming, integer programming, time series prediction, optimization, sensor data, adaptive systems, Neural Computing and Applications