GraphCpG:基于位点感知相邻子图的单细胞甲基组插补。

IF 4.4 3区 生物学 Q1 BIOCHEMICAL RESEARCH METHODS
Yuzhong Deng, Jianxiong Tang, Jiyang Zhang, Jianxiao Zou, Que Zhu, Shicai Fan
{"title":"GraphCpG:基于位点感知相邻子图的单细胞甲基组插补。","authors":"Yuzhong Deng,&nbsp;Jianxiong Tang,&nbsp;Jiyang Zhang,&nbsp;Jianxiao Zou,&nbsp;Que Zhu,&nbsp;Shicai Fan","doi":"10.1093/bioinformatics/btad533","DOIUrl":null,"url":null,"abstract":"<p><strong>Motivation: </strong>Single-cell DNA methylation sequencing can assay DNA methylation at single-cell resolution. However, incomplete coverage compromises related downstream analyses, outlining the importance of imputation techniques. With a rising number of cell samples in recent large datasets, scalable and efficient imputation models are critical to addressing the sparsity for genome-wide analyses.</p><p><strong>Results: </strong>We proposed a novel graph-based deep learning approach to impute methylation matrices based on locus-aware neighboring subgraphs with locus-aware encoding orienting on one cell type. Merely using the CpGs methylation matrix, the obtained GraphCpG outperforms previous methods on datasets containing more than hundreds of cells and achieves competitive performance on smaller datasets, with subgraphs of predicted sites visualized by retrievable bipartite graphs. Besides better imputation performance with increasing cell number, it significantly reduces computation time and demonstrates improvement in downstream analysis.</p><p><strong>Availability and implementation: </strong>The source code is freely available at https://github.com/yuzhong-deng/graphcpg.git.</p>","PeriodicalId":8903,"journal":{"name":"Bioinformatics","volume":" ","pages":""},"PeriodicalIF":4.4000,"publicationDate":"2023-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10516632/pdf/","citationCount":"0","resultStr":"{\"title\":\"GraphCpG: imputation of single-cell methylomes based on locus-aware neighboring subgraphs.\",\"authors\":\"Yuzhong Deng,&nbsp;Jianxiong Tang,&nbsp;Jiyang Zhang,&nbsp;Jianxiao Zou,&nbsp;Que Zhu,&nbsp;Shicai Fan\",\"doi\":\"10.1093/bioinformatics/btad533\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><strong>Motivation: </strong>Single-cell DNA methylation sequencing can assay DNA methylation at single-cell resolution. However, incomplete coverage compromises related downstream analyses, outlining the importance of imputation techniques. With a rising number of cell samples in recent large datasets, scalable and efficient imputation models are critical to addressing the sparsity for genome-wide analyses.</p><p><strong>Results: </strong>We proposed a novel graph-based deep learning approach to impute methylation matrices based on locus-aware neighboring subgraphs with locus-aware encoding orienting on one cell type. Merely using the CpGs methylation matrix, the obtained GraphCpG outperforms previous methods on datasets containing more than hundreds of cells and achieves competitive performance on smaller datasets, with subgraphs of predicted sites visualized by retrievable bipartite graphs. Besides better imputation performance with increasing cell number, it significantly reduces computation time and demonstrates improvement in downstream analysis.</p><p><strong>Availability and implementation: </strong>The source code is freely available at https://github.com/yuzhong-deng/graphcpg.git.</p>\",\"PeriodicalId\":8903,\"journal\":{\"name\":\"Bioinformatics\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":4.4000,\"publicationDate\":\"2023-09-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10516632/pdf/\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Bioinformatics\",\"FirstCategoryId\":\"99\",\"ListUrlMain\":\"https://doi.org/10.1093/bioinformatics/btad533\",\"RegionNum\":3,\"RegionCategory\":\"生物学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"BIOCHEMICAL RESEARCH METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bioinformatics","FirstCategoryId":"99","ListUrlMain":"https://doi.org/10.1093/bioinformatics/btad533","RegionNum":3,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"BIOCHEMICAL RESEARCH METHODS","Score":null,"Total":0}
引用次数: 0

摘要

动机:单细胞DNA甲基化测序可以以单细胞分辨率测定DNA甲基化。然而,不完全覆盖损害了相关的下游分析,概述了插补技术的重要性。随着最近大型数据集中细胞样本数量的增加,可扩展和高效的插补模型对于解决全基因组分析的稀疏性至关重要。结果:我们提出了一种新的基于图的深度学习方法,以基于位点感知相邻子图的甲基化矩阵,其中位点感知编码面向一种细胞类型。仅使用CpGs甲基化矩阵,所获得的GraphCpG在包含数百个以上细胞的数据集上优于以前的方法,并在较小的数据集中实现了竞争性能,预测位点的子图通过可检索的二分图可视化。除了随着细胞数量的增加而获得更好的插补性能外,它还显著减少了计算时间,并证明了下游分析的改进。可用性和实现:源代码可在https://github.com/yuzhong-deng/graphcpg.git.
本文章由计算机程序翻译,如有差异,请以英文原文为准。

GraphCpG: imputation of single-cell methylomes based on locus-aware neighboring subgraphs.

GraphCpG: imputation of single-cell methylomes based on locus-aware neighboring subgraphs.

GraphCpG: imputation of single-cell methylomes based on locus-aware neighboring subgraphs.

GraphCpG: imputation of single-cell methylomes based on locus-aware neighboring subgraphs.

Motivation: Single-cell DNA methylation sequencing can assay DNA methylation at single-cell resolution. However, incomplete coverage compromises related downstream analyses, outlining the importance of imputation techniques. With a rising number of cell samples in recent large datasets, scalable and efficient imputation models are critical to addressing the sparsity for genome-wide analyses.

Results: We proposed a novel graph-based deep learning approach to impute methylation matrices based on locus-aware neighboring subgraphs with locus-aware encoding orienting on one cell type. Merely using the CpGs methylation matrix, the obtained GraphCpG outperforms previous methods on datasets containing more than hundreds of cells and achieves competitive performance on smaller datasets, with subgraphs of predicted sites visualized by retrievable bipartite graphs. Besides better imputation performance with increasing cell number, it significantly reduces computation time and demonstrates improvement in downstream analysis.

Availability and implementation: The source code is freely available at https://github.com/yuzhong-deng/graphcpg.git.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Bioinformatics
Bioinformatics 生物-生化研究方法
CiteScore
11.20
自引率
5.20%
发文量
753
审稿时长
2.1 months
期刊介绍: The leading journal in its field, Bioinformatics publishes the highest quality scientific papers and review articles of interest to academic and industrial researchers. Its main focus is on new developments in genome bioinformatics and computational biology. Two distinct sections within the journal - Discovery Notes and Application Notes- focus on shorter papers; the former reporting biologically interesting discoveries using computational methods, the latter exploring the applications used for experiments.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信