SPADE Algorithm for Flow Cytometry Hierarchical Analysis

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current flow cytometry data analysis methods are subjective, labor-intensive, and inadequate for handling large datasets with multiple parameters, often missing rare cell types and failing to represent cellular differentiation hierarchies due to limitations in scalability and visualization.

Innovation Solution

The implementation of a computational algorithm that constructs a branched hierarchical tree structure for analyzing flow cytometry data, enabling automated gating and visualization of cellular features across the entire hierarchy without requiring prior knowledge of cellular ordering, using techniques such as density-dependent downsampling, agglomerative clustering, and minimum spanning tree construction.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If traditional flow cytometry analysis methods are used, then analysis can be performed with simple tools, but the analysis becomes subjective, labor-intensive, and inadequate for handling large datasets with multiple parameters

Engineering Contradiction:
Improveanalysis efficiencyVSAvoidcomputational algorithm complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The system performs automated gating and hierarchical clustering without requiring manual intervention. The computational algorithm automatically processes flow cytometry data, constructs branched hierarchical tree structures, and identifies cell subpopulations, eliminating the need for subjective manual gating while maintaining analysis accuracy

Inventive Principle:
Principle #25Self-service

Solution Approach 2:

The patent replaces manual analytical methods with computational algorithms. Instead of researchers manually gating cells based on visual inspection, the system uses automated clustering algorithms and minimum spanning tree construction to objectively analyze high-dimensional flow cytometry data, substituting mechanical manual operations with computational processing

Inventive Principle:
Principle #28Mechanics substitution (Replace mechanical system)

2Measurement precision

If manual gating methods are used to analyze cell populations, then the analysis process is simple, but rare cell types are missed and cellular differentiation hierarchies are not represented

Engineering Contradiction:
Improvedetection accuracy of rare cell typesVSAvoidanalysis time
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

The computational algorithm segments the cell population into hierarchical clusters, organizing cells into a branched tree structure that reveals differentiation hierarchies. This segmentation approach automatically identifies rare cell types by creating distinct clusters based on marker expression patterns, preventing them from being missed in the analysis

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The system transforms the analysis from traditional two-dimensional scatter plots to high-dimensional space analysis using multiple markers simultaneously. By constructing minimum spanning trees in high-dimensional marker space, the algorithm can detect rare cell types and hierarchical relationships that are invisible in conventional two-dimensional visualizations

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

3Loss of information

If high-dimensional flow cytometry data is visualized using traditional methods, then the visualization is simple, but the data cannot be effectively analyzed and interpreted

Engineering Contradiction:
Improveinformation retention in visualizationVSAvoidvisualization system complexity
Core Design Contradiction:
Loss of informationVSDevice complexity

Solution Approach 1:

The system extracts the essential hierarchical structure from high-dimensional flow cytometry data by constructing minimum spanning trees. This extraction process identifies and visualizes the key differentiation pathways and cell subpopulations, separating the essential biological information from the complexity of high-dimensional marker expressions

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The patent introduces computational algorithms as an intermediary between raw high-dimensional data and human interpretation. The minimum spanning tree construction and hierarchical clustering algorithms serve as mediators that transform complex multi-parameter data into intuitive tree structures that preserve biological information while being easily interpretable

Inventive Principle:
Principle #24Intermediary (Mediator)

Data Source

PatentUS10289802B2Spanning-tree progression analysis of density-normalized events (SPADE)
Publication Date: 2019.05.14 THE BOARD OF TRUSTEES OF THE LELAND STANFORD JUNIOR UNIV
  • US10289802B2 patent drawing
  • US10289802B2 patent drawing
  • US10289802B2 patent drawing

AI summary

Methods and systems for determining progression and other characteristics of microarray expression levels and similar information, alternatively using a network or communications medium or tangible storage medium or logic processor.