A Graph‐Theoretic Approach to Minimizing Union Operations for Optimal FMO Construction
Cytometry Part A · 2026-06 · 109 (6) · 456-459
DOI: 10.1002/cyto.a.70032 ↗Kurz gefasst
Fachartikel in der Zeitschrift Cytometry Part A, online erschienen am 03.05.2026. Verfasst von Ryan Kmet und 2 weiteren Autor:innen. Beteiligte Einrichtung: De Novo Research, Pasadena, California, USA. Hauptthemen laut MEDLINE: Algorithms, Flow Cytometry, Models, Theoretical. Die Arbeit nennt 9 Literaturangaben.
Abstract (Originalsprache)
We model the process of computing all ‐element subsets of an ‐element set (representing a set of fluorescence minus one [FMO] controls) using only binary union operations. By representing this process as a Directed Acyclic Graph (DAG), we present an algorithm that can make all FMOs in the theoretical minimum unions (when ). Finally, we generalize the construction to arbitrary subsets of leave‐one‐out targets and prove a bound on the number of operations in such cases.
Schlagwörter
MeSH-Schlagwörter (MEDLINE)
Autor:innen und Institutionen
- De Novo Research, Pasadena, California, USA.
ORCID-Profile: David Novo
Zitieren
APA
Kmet, R., Zhou, S., & Novo, D. (2026). A Graph‐Theoretic Approach to Minimizing Union Operations for Optimal FMO Construction. Cytometry Part A, 109(6), 456-459. https://doi.org/10.1002/cyto.a.70032
Vancouver
Kmet R, Zhou S, Novo D. A Graph‐Theoretic Approach to Minimizing Union Operations for Optimal FMO Construction. Cytometry Part A. 2026;109(6):456-459. doi:10.1002/cyto.a.70032
BibTeX
@article{Kmet2026,
author = {Kmet, Ryan and Zhou, Shuchan and Novo, David},
title = {A Graph‐Theoretic Approach to Minimizing Union Operations for Optimal FMO Construction},
journal = {Cytometry Part A},
year = {2026},
volume = {109},
number = {6},
pages = {456--459},
doi = {10.1002/cyto.a.70032}
}
EUVIMED