Pattern sorting: a computer-controlled multidimensional sorting method using k-d trees.
Multidimensional binary trees provide a memory efficient and general method for computing sorting decisions in real time for a flow cytometer. Their fundamental advantage over conventional lookup table sorting techniques is that sort criteria in the full N-dimensional data space which cannot be described by projections onto two-dimensional parameter planes can be effectively implemented. This becomes particularly relevant when multidimensional analysis methods such as principal components or clustering are employed. We describe a prototype implementation of this method and point out other possible implementations.
Bigos
M
M
Department of Genetics, Stanford University School of Medicine, California 94305-5125.
Parks
D R
DR
Moore
W A
WA
Herzenberg
L A
LA
Herzenberg
L A
LA
D016000:Cluster Analysis; D003199:Computer Systems; D003663:Decision Trees; D005434:Flow Cytometry / Q000379:methods*; D010363:Pattern Recognition, Automated