Your browser doesn't support javascript.
loading
Mostrar: 20 | 50 | 100
Resultados 1 - 4 de 4
Filtrar
1.
Nat Biotechnol ; 37(4): 451-460, 2019 04.
Artigo em Inglês | MEDLINE | ID: mdl-30899105

RESUMO

Single-cell RNA sequencing studies of differentiating systems have raised fundamental questions regarding the discrete versus continuous nature of both differentiation and cell fate. Here we present Palantir, an algorithm that models trajectories of differentiating cells by treating cell fate as a probabilistic process and leverages entropy to measure cell plasticity along the trajectory. Palantir generates a high-resolution pseudo-time ordering of cells and, for each cell state, assigns a probability of differentiating into each terminal state. We apply our algorithm to human bone marrow single-cell RNA sequencing data and detect important landmarks of hematopoietic differentiation. Palantir's resolution enables the identification of key transcription factors that drive lineage fate choice and closely track when cells lose plasticity. We show that Palantir outperforms existing algorithms in identifying cell lineages and recapitulating gene expression trends during differentiation, is generalizable to diverse tissue types, and is well-suited to resolving less-studied differentiating systems.


Assuntos
Algoritmos , Diferenciação Celular/genética , Linhagem da Célula/genética , Análise de Sequência de RNA/estatística & dados numéricos , Análise de Célula Única/estatística & dados numéricos , Animais , Biotecnologia , Células da Medula Óssea/citologia , Células da Medula Óssea/metabolismo , Eritropoese/genética , Regulação da Expressão Gênica no Desenvolvimento , Hematopoese/genética , Humanos , Cadeias de Markov , Camundongos , Modelos Biológicos , Modelos Estatísticos
2.
Cell ; 174(3): 716-729.e27, 2018 07 26.
Artigo em Inglês | MEDLINE | ID: mdl-29961576

RESUMO

Single-cell RNA sequencing technologies suffer from many sources of technical noise, including under-sampling of mRNA molecules, often termed "dropout," which can severely obscure important gene-gene relationships. To address this, we developed MAGIC (Markov affinity-based graph imputation of cells), a method that shares information across similar cells, via data diffusion, to denoise the cell count matrix and fill in missing transcripts. We validate MAGIC on several biological systems and find it effective at recovering gene-gene relationships and additional structures. Applied to the epithilial to mesenchymal transition, MAGIC reveals a phenotypic continuum, with the majority of cells residing in intermediate states that display stem-like signatures, and infers known and previously uncharacterized regulatory interactions, demonstrating that our approach can successfully uncover regulatory relations without perturbations.


Assuntos
Perfilação da Expressão Gênica/métodos , Análise de Sequência de RNA/métodos , Análise de Célula Única/métodos , Algoritmos , Linhagem Celular , Epistasia Genética/genética , Redes Reguladoras de Genes/genética , Humanos , Cadeias de Markov , MicroRNAs/genética , RNA Mensageiro/genética , Software
3.
J Comput Biol ; 16(2): 201-12, 2009 Feb.
Artigo em Inglês | MEDLINE | ID: mdl-19193145

RESUMO

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.


Assuntos
Algoritmos , Inteligência Artificial , Cadeias de Markov , Transdução de Sinais , Teorema de Bayes , Citometria de Fluxo , Modelos Biológicos
4.
Sci STKE ; 2005(281): pl4, 2005 Apr 26.
Artigo em Inglês | MEDLINE | ID: mdl-15855409

RESUMO

High-throughput proteomic data can be used to reveal the connectivity of signaling networks and the influences between signaling molecules. We present a primer on the use of Bayesian networks for this task. Bayesian networks have been successfully used to derive causal influences among biological signaling molecules (for example, in the analysis of intracellular multicolor flow cytometry). We discuss ways to automatically derive a Bayesian network model from proteomic data and to interpret the resulting model.


Assuntos
Teorema de Bayes , Proteômica , Transdução de Sinais , Algoritmos , Animais , Causalidade , Genótipo , Humanos , Funções Verossimilhança , Cadeias de Markov , Modelos Biológicos
SELEÇÃO DE REFERÊNCIAS
DETALHE DA PESQUISA