Learning signaling network structures with sparsely distributed data.
Flow cytometric measurement of signaling protein abundances has proved particularly useful for elucidation of signaling pathway structure. The single cell nature of the data ensures a very large dataset size, providing a statistically robust dataset for structure learning. Moreover, the approach is easily scaled to many conditions in high throughput. However, the technology suffers from a dimensionality constraint: at the cutting edge, only about 12 protein species can be measured per cell, far from sufficient for most signaling pathways. Because the structure learning algorithm (in practice) requires that all variables be measured together simultaneously, this restricts structure learning to the number of variables that constitute the flow cytometer's upper dimensionality limit. To address this problem, we present here an algorithm that enables structure learning for sparsely distributed data, allowing structure learning beyond the measurement technology's upper dimensionality limit for simultaneously measurable variables. The algorithm assesses pairwise (or n-wise) dependencies, constructs "Markov neighborhoods" for each variable based on these dependencies, measures each variable in the context of its neighborhood, and performs structure learning using a constrained search.
Sachs
Karen
K
Department of Microbiology and Immunology, Baxter Laboratory in Genetic Pharmacology, Stanford University School of Medicine, Stanford, CA, USA.
Itani
Solomon
S
Carlisle
Jennifer
J
Nolan
Garry P
GP
Pe'er
Dana
D
Lauffenburger
Douglas A
DA
D000465:Algorithms; D001185:Artificial Intelligence; D001499:Bayes Theorem; D005434:Flow Cytometry; D008390:Markov Chains; D008954:Models, Biological; D015398:Signal Transduction