paper-with-me

홈 › Papers

GatingTree: Pathfinding Analysis of Group-Specific Effects in Cytometry Data

2024-10-31 · Masahiro Ono

Advancements in cytometry technologies have led to a remarkable increase in the number of markers that can be analyzed simultaneously, presenting significant challenges in data analysis. Traditional approaches, such as dimensional reduction techniques and computational clustering, although popular, often face reproducibility challenges due to their heavy reliance on inherent data structures, preventing direct translation of their outputs into gating strategies to be used in downstream experiments. Here we propose the novel Gating Tree methodology, a pathfinding approach that investigates the multidimensional data landscape to unravel group-specific features without the use of dimensional reduction. This method employs novel measures, including enrichment scores and gating entropy, to effectively identify group-specific features within high-dimensional cytometric datasets. Our analysis, applied to both simulated and real cytometric datasets, demonstrates that the Gating Tree not only identifies group-specific features comprehensively but also produces outputs that are immediately usable as gating strategies for unequivocally identifying cell populations. In conclusion, the Gating Tree facilitates a comprehensive analysis of the multidimensional data landscape and provides experimentalists with practical, successive gating strategies that enhance cross-experimental comparisons and downstream analyses such as flow cytometric sorting.

📄 PDF Abstract BibTeX arXiv:2411.00129

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

CayleyPy RL: Pathfinding and Reinforcement Learning on Cayley Graphs

2025-02-25 · A. Chervov, A. Soibelman, S. Lytkin, I. Kiselev 외

This paper is the second in a series of studies on developing efficient artificial intelligence-based approaches to pathfinding on extremely large graphs (e.g. $10^{70}$ nodes) with a focus on Cayley graphs and mathemati…

Benchmarkingreinforcement-learningReinforcement Learning

Key-Interval A*: Accelerating Grid Pathfinding via Structural Abstraction

2026-07-25 · Taiquan Sui arxiv

Existing exact methods for 4-connected grid pathfinding reduce online search, but often either retain fine-grained search states or require substantial preprocessing. This paper presents Key-Interval A* (KIA*), an optima…

Decentralized Monte Carlo Tree Search for Partially Observable Multi-agent Pathfinding

2023-12-26 · Alexey Skrynnik, Anton Andreychuk, Konstantin Yakovlev, Aleksandr Panov

The Multi-Agent Pathfinding (MAPF) problem involves finding a set of conflict-free paths for a group of agents confined to a graph. In typical MAPF scenarios, the graph and the agents' starting and ending vertices are kn…

Alternating Target-Path Planning for Scalable Multi-Agent Coordination

2026-05-08 · Yu Kumagai, Keisuke Okumura arxiv

The concurrent target assignment and pathfinding (TAPF) problem extends multi-agent pathfinding (MAPF) by asking planners to allocate distinct targets and collision-free paths to agents. Prior work on TAPF has relied exc…

3D Pathfinding and Collision Avoidance Using Uneven Search-space Quantization and Visual Cone Search

2017-06-05 · Diptangshu Pandit

Pathfinding is a very popular area in computer game development. While two-dimensional (2D) pathfinding is widely applied in most of the popular game engines, little implementation of real three-dimensional (3D) pathfind…

Collision AvoidanceQuantization