.png){kind=icon}
.png){kind=icon}
Return
Benchmarking algorithms for gene regulatory network inference from single-cell transcriptomic data
.png){kind=icon}
OA
AI
DOI：10.1038/s41592-019-0690-6.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present a systematic evaluation of state-of-the-art algorithms for inferring gene regulatory networks from single-cell transcriptional data. As the ground truth for assessing accuracy, we use synthetic networks with predictable trajectories, literature-curated Boolean models and diverse transcriptional regulatory networks. We develop a strategy to simulate single-cell transcriptional data from synthetic and Boolean networks that avoids pitfalls of previously used methods. Furthermore, we collect networks from multiple experimental single-cell RNA-seq datasets. We develop an evaluation framework called BEELINE. We find that the area under the precision-recall curve and early precision of the algorithms are moderate. The methods are better in recovering interactions in synthetic networks than Boolean models. The algorithms with the best early precision values for Boolean models also perform well on experimental datasets. Techniques that do not require pseudotime-ordered cells are generally more accurate. Based on these results, we present recommendations to end users. BEELINE will aid the development of gene regulatory network inference algorithms. Comprehensive evaluation of algorithms for inferring gene regulatory networks using synthetic and experimental single-cell RNA-seq datasets finds heterogeneous performance and suggests recommendations to users.
Keywords:
RNA-SEQ
MODEL
TIME
STEM
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
32.1
Papers:
7.2K
Citations:
12.7W
Organization
No organization information available