Suppr超能文献

基于机器学习的谱系树重建随着对细胞与基因组条形码之间更高层次关系的了解而得到改进。

Machine learning based lineage tree reconstruction improved with knowledge of higher level relationships between cells and genomic barcodes.

作者信息

Prusokiene Alisa, Prusokas Augustinas, Retkute Renata

机构信息

School of Natural and Environmental Sciences, Newcastle University, Newcastle upon Tyne NE1 7RU, UK.

Independent researcher, London, SW7 2BX, UK.

出版信息

NAR Genom Bioinform. 2023 Aug 21;5(3):lqad077. doi: 10.1093/nargab/lqad077. eCollection 2023 Sep.

Abstract

Tracking cells as they divide and progress through differentiation is a fundamental step in understanding many biological processes, such as the development of organisms and progression of diseases. In this study, we investigate a machine learning approach to reconstruct lineage trees in experimental systems based on mutating synthetic genomic barcodes. We refine previously proposed methodology by embedding information of higher level relationships between cells and single-cell barcode values into a feature space. We test performance of the algorithm on shallow trees (up to 100 cells) and deep trees (up to 10 000 cells). Our proposed algorithm can improve tree reconstruction accuracy in comparison to reconstructions based on a maximum parsimony method, but this comes at a higher computational time requirement.

摘要

追踪细胞分裂和分化过程是理解许多生物过程(如生物体发育和疾病进展)的基本步骤。在本研究中,我们研究了一种基于突变合成基因组条形码在实验系统中重建谱系树的机器学习方法。我们通过将细胞与单细胞条形码值之间更高层次关系的信息嵌入特征空间来改进先前提出的方法。我们在浅层树(最多100个细胞)和深层树(最多10000个细胞)上测试了该算法的性能。与基于最大简约法的重建相比,我们提出的算法可以提高树重建的准确性,但这需要更高的计算时间。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/0564/10440785/c4df96645b0f/lqad077fig1.jpg

文献AI研究员

20分钟写一篇综述,助力文献阅读效率提升50倍。

立即体验

用中文搜PubMed

大模型驱动的PubMed中文搜索引擎

马上搜索

文档翻译

学术文献翻译模型,支持多种主流文档格式。

立即体验