<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>cell fate decisions &#8211; Science</title>
	<atom:link href="https://scienmag.com/tag/cell-fate-decisions/feed/" rel="self" type="application/rss+xml" />
	<link>https://scienmag.com</link>
	<description></description>
	<lastBuildDate>Tue, 06 Oct 2026 11:45:06 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=7.1.2</generator>

<image>
	<url>https://scienmag.com/wp-content/uploads/2024/07/cropped-scienmag_ico-32x32.jpg</url>
	<title>cell fate decisions &#8211; Science</title>
	<link>https://scienmag.com</link>
	<width>32</width>
	<height>32</height>
</image> 
<site xmlns="com-wordpress:feed-additions:1">73899611</site>	<item>
		<title>Binary Trees for Cell Fates: New Algorithm Reshapes Single-Cell Trajectory Inference</title>
		<link>https://scienmag.com/binary-trees-for-cell-fates-new-algorithm-reshapes-single-cell-trajectory-inference/</link>
		
		<dc:creator><![CDATA[Juliet Wilcox]]></dc:creator>
		<pubDate>Tue, 06 Oct 2026 11:45:06 +0000</pubDate>
				<category><![CDATA[Biology]]></category>
		<category><![CDATA[algorithms for single-cell data analysis]]></category>
		<category><![CDATA[binary tree algorithms in developmental biology]]></category>
		<category><![CDATA[biological interpretation of cell lineage trees]]></category>
		<category><![CDATA[branching diagrams in cell differentiation]]></category>
		<category><![CDATA[cell fate decision modeling]]></category>
		<category><![CDATA[cell fate decisions]]></category>
		<category><![CDATA[computational biology]]></category>
		<category><![CDATA[constrained branching in trajectory inference]]></category>
		<category><![CDATA[CoSpar]]></category>
		<category><![CDATA[discrete optimization]]></category>
		<category><![CDATA[graph theory in cell fate analysis]]></category>
		<category><![CDATA[hematopoiesis]]></category>
		<category><![CDATA[integer programming]]></category>
		<category><![CDATA[minimum spanning tree]]></category>
		<category><![CDATA[minimum spanning tree in bioinformatics]]></category>
		<category><![CDATA[pseudotime]]></category>
		<category><![CDATA[reconstructing cell decision paths]]></category>
		<category><![CDATA[resolving multifurcations in developmental trees]]></category>
		<category><![CDATA[single-cell gene expression profiling]]></category>
		<category><![CDATA[single-cell RNA-seq]]></category>
		<category><![CDATA[single-cell trajectory inference]]></category>
		<category><![CDATA[Slingshot]]></category>
		<category><![CDATA[trajectory inference]]></category>
		<category><![CDATA[Waddington's epigenetic landscape]]></category>
		<guid isPermaLink="false">https://scienmag.com/?p=241214</guid>

					<description><![CDATA[Researchers in Hong Kong and Japan have developed an integer programming method that constrains single-cell trajectory trees to binary branching, aligning inferred cell fate hierarchies with Waddington's epigenetic landscape.]]></description>
										<content:encoded><![CDATA[<p>Every cell in a developing organism carries an invisible history. A blood stem cell in the bone marrow, for instance, holds within its gene expression profile the record of decisions that will eventually push it toward becoming an oxygen-carrying red cell, an infection-fighting white cell, or a platelet-producing fragment of cytoplasm. Biologists have long sought to reconstruct these hidden decision paths from static snapshots of thousands of individual cells, a task known as trajectory inference. Now, a team of researchers from The University of Hong Kong and Kyoto University has introduced a mathematically rigorous way to make those reconstructed paths look more like the branching diagrams developmental biologists actually expect to see. Their work, published in BMC Bioinformatics, applies a classic tool from graph theory, the minimum spanning tree, but with a twist that constrains how many branches any single point in the tree can sprout.</p>
<p>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&#8217;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.</p>
<p>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&#8217;s or Prim&#8217;s can solve efficiently into a harder combinatorial optimization problem, but one whose solutions carry direct biological meaning.</p>
<p>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.</p>
<p>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.</p>
<p>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.</p>
<p>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.</p>
<p>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&#8217; 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.</p>
<p>The conceptual appeal of the method extends beyond hematopoiesis. Waddington&#8217;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.</p>
<p>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.</p>
<p><strong>Subject of Research:</strong> Degree-restricted minimum spanning tree algorithms for binary cell trajectory inference in single-cell RNA-seq data</p>
<p><strong>Article Title:</strong> Degree-restricted minimum spanning trees for binary cell trajectory inference in single-cell RNA-seq data</p>
<p><strong>Article References:</strong> Zhao, J., Iwaki, T., Mori, T., Ching, W.-K., &amp; Akutsu, T. (2026). Degree-restricted minimum spanning trees for binary cell trajectory inference in single-cell RNA-seq data. <em>BMC Bioinformatics</em>. <a href="https://doi.org/10.1186/s12859-026-06674-y" rel="noopener noreferrer">https://doi.org/10.1186/s12859-026-06674-y</a></p>
<p><strong>Image Credits:</strong> AI Generated</p>
<p><strong>DOI:</strong> <a href="https://doi.org/10.1186/s12859-026-06674-y" rel="noopener noreferrer">10.1186/s12859-026-06674-y</a></p>
<p><strong>Keywords:</strong> single-cell RNA-seq, trajectory inference, pseudotime, minimum spanning tree, integer programming, Waddington&#x27;s epigenetic landscape, hematopoiesis, Slingshot, CoSpar, cell fate decisions, computational biology, discrete optimization</p>
]]></content:encoded>
					
		
		
		<post-id xmlns="com-wordpress:feed-additions:1">241214</post-id>	</item>
		<item>
		<title>MKK4 Controls JNK Activation and Cell Fate Choices</title>
		<link>https://scienmag.com/mkk4-controls-jnk-activation-and-cell-fate-choices/</link>
		
		<dc:creator><![CDATA[Ophelia Keating]]></dc:creator>
		<pubDate>Thu, 08 Jan 2026 17:23:44 +0000</pubDate>
				<category><![CDATA[Medicine]]></category>
		<category><![CDATA[apoptosis and survival mechanisms]]></category>
		<category><![CDATA[binary cell-fate choices]]></category>
		<category><![CDATA[c-Jun N-terminal kinase signaling]]></category>
		<category><![CDATA[cell fate decisions]]></category>
		<category><![CDATA[computational modeling in biology]]></category>
		<category><![CDATA[developmental biology insights]]></category>
		<category><![CDATA[implications for disease mechanisms]]></category>
		<category><![CDATA[JNK pathway activation]]></category>
		<category><![CDATA[live cell imaging techniques]]></category>
		<category><![CDATA[MKK4 spatiotemporal regulation]]></category>
		<category><![CDATA[molecular switches in cellular processes]]></category>
		<category><![CDATA[stress response signaling pathways]]></category>
		<guid isPermaLink="false">https://scienmag.com/mkk4-controls-jnk-activation-and-cell-fate-choices/</guid>

					<description><![CDATA[In a groundbreaking study that reshapes our understanding of cellular signaling pathways, researchers have illuminated the pivotal role of MKK4&#8217;s spatiotemporal regulation in orchestrating switch-like activation of the JNK pathway, ultimately governing binary cell-fate decisions. This discovery, detailed in the recent publication by Moriizumi et al. in Nature Communications, offers critical insights into how cells [&#8230;]]]></description>
										<content:encoded><![CDATA[<p>In a groundbreaking study that reshapes our understanding of cellular signaling pathways, researchers have illuminated the pivotal role of MKK4&#8217;s spatiotemporal regulation in orchestrating switch-like activation of the JNK pathway, ultimately governing binary cell-fate decisions. This discovery, detailed in the recent publication by Moriizumi et al. in Nature Communications, offers critical insights into how cells decisively commit to survival or programmed death, a fundamental process with profound implications for development and disease.</p>
<p>The c-Jun N-terminal kinase (JNK) pathway has long been recognized as a crucial mediator of stress responses, apoptosis, and developmental processes. However, the precise molecular mechanisms by which cells interpret complex signals to toggle JNK activity on or off have remained elusive. Moriizumi and colleagues have now uncovered that the spatiotemporal dynamics of MKK4, an upstream kinase in the JNK cascade, serve as a molecular switch that dictates whether JNK activation proceeds in a digital, all-or-none fashion.</p>
<p>Employing cutting-edge live-cell imaging techniques combined with sophisticated computational modeling, the team visualized MKK4&#8217;s localization and activation patterns within the cell over time. Their data revealed that MKK4 does not activate JNK in a gradual, analog manner but rather engages in switch-like behavior characterized by rapid and complete activation pulses. This binary response is critical for ensuring precise cell-fate outcomes, preventing ambiguous or partial signaling that could lead to pathological states.</p>
<p>Further molecular dissection demonstrated that the regulation of MKK4’s activity and distribution depends on a finely tuned balance between its phosphorylation state and spatial sequestration within subcellular compartments. By manipulating these parameters experimentally, the researchers were able to modulate the thresholds for JNK activation, confirming the model’s predictive capability. This exquisite control mechanism underscores how spatial cues within the cell contribute to temporal signaling precision.</p>
<p>The implications of MKK4’s switch-like regulation extend beyond fundamental cell biology, touching upon a variety of pathological conditions. Aberrant JNK signaling is implicated in cancer, neurodegeneration, and inflammatory diseases. Understanding how MKK4 governs JNK’s binary activation opens new avenues for therapeutic strategies aimed at modulating this pathway with high specificity and minimal off-target effects.</p>
<p>Moreover, this study challenges existing paradigms that often view kinase signaling as a continuum of activity levels. Instead, it provides robust evidence that cells employ digital signaling logic, akin to binary code, to ensure fidelity in critical decisions such as apoptosis versus survival. This conceptual shift could pave the way for revisiting other signaling networks with fresh perspectives and analytical frameworks.</p>
<p>The researchers also highlighted the broader biological significance of their findings by exploring how such binary signaling informs tissue development and homeostasis. In differentiation contexts, where cells must irrevocably commit to specialized lineages, the switch-like activation of JNK mediated by MKK4 ensures that gene expression programs are sharply delineated rather than ambiguous, thus safeguarding organismal integrity.</p>
<p>From a methodological standpoint, this investigation exemplifies the power of integrating real-time imaging with quantitative analysis to unravel complex signaling behaviors. The team&#8217;s innovative use of biosensors for kinase activity allowed unprecedented temporal resolution, capturing transient yet decisive activation events that traditional biochemical assays may overlook.</p>
<p>Intriguingly, the study also hints at the evolutionary conservation of such spatiotemporal regulatory mechanisms. Given that JNK pathways are conserved across metazoans, understanding MKK4&#8217;s role offers insights into how ancient signaling modules have adapted switches to manage cellular responses in diverse physiological contexts.</p>
<p>The interplay between MKK4’s localization and phosphorylation presents a compelling example of how multi-layered regulation ensures signaling robustness. The spatial segregation of active and inactive MKK4 pools can create discrete signaling territories within cells, effectively functioning as isolated microdomains for signal propagation or attenuation.</p>
<p>Moriizumi et al.&#8217;s findings also suggest potential for pharmacological intervention by targeting MKK4&#8217;s spatial regulators or modifying its phosphorylation dynamics, enabling precise tuning of JNK activity. Such strategies could yield refined treatments that leverage the cell&#8217;s inherent signaling architecture rather than simply inhibiting pathways broadly.</p>
<p>In summary, the elucidation of MKK4’s spatiotemporal control as a determinant of switch-like JNK activation marks a major advance in cell signaling research. This discovery elucidates how cellular systems convert graded inputs into decisive outcomes, a principle likely fundamental to many biological processes. The work sets a new benchmark for exploring the molecular underpinnings of cell fate and exemplifies how dynamic regulation at the nanoscale governs life at the macroscale.</p>
<p>As the field moves forward, these revelations about MKK4 and JNK signaling invite broader exploration of how spatial and temporal factors coalesce to generate binary decisions in other signaling networks. Such insights are poised to reshape our therapeutic approaches and deepen our grasp of cellular logic in health and disease.</p>
<p>This landmark study not only enhances our mechanistic understanding but also fuels optimism for designing innovative interventions that harness the binary nature of signaling pathways. Through integrating multidisciplinary approaches, Moriizumi and colleagues have charted a path toward deciphering the intricate decision-making code within cells.</p>
<hr />
<p>Subject of Research: Regulation of MKK4 in JNK signaling and its role in binary cell-fate decisions</p>
<p>Article Title: Spatiotemporal regulation of MKK4 dictates switch-like JNK activation and binary cell-fate decisions</p>
<p>Article References: Moriizumi, H., Nakamura, T., Kubota, Y. et al. Spatiotemporal regulation of MKK4 dictates switch-like JNK activation and binary cell-fate decisions. Nat Commun 17, 97 (2026). https://doi.org/10.1038/s41467-025-67943-7</p>
<p>Image Credits: AI Generated</p>
<p>DOI: https://doi.org/10.1038/s41467-025-67943-7</p>
]]></content:encoded>
					
		
		
		<post-id xmlns="com-wordpress:feed-additions:1">124506</post-id>	</item>
	</channel>
</rss>
