arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1310.6401q-bio.GN
收藏

自适应压缩基因组测序策略的集成分析

Ensemble Analysis of Adaptive Compressed Genome Sequencing Strategies

Zeinab Taghavi

摘要:

以单细胞分辨率获取基因组具有许多应用,例如在微生物群的研究中。然而,对样品中所有数百万个细胞进行深度测序和组装的成本过高。一个可以拯救的特性是,对每个细胞进行深度测序不需要捕获所有不同的基因组,因为大多数细胞都是生物复制品。从这个意义上说,生物学上重要的样本往往是稀疏的。在本文中,我们提出了一种自适应压缩方法,也称为蒸馏传感,以捕获稀疏的微生物群落中的所有不同的基因组,减少测序工作。与组测试中不同事件的数量通常是恒定的,稀疏性相当于事件的稀有性相反,稀疏性在我们的情况下意味着与数据大小相比不同事件的稀缺性。在此之前,我们介绍了这个问题,并提出了一个基于广度优先搜索策略的提取传感解决方案。我们模拟了整个过程,由于其计算强度,限制了我们研究整个系综算法行为的能力。在本文中,我们修改我们以前的广度优先搜索策略,并引入深度优先搜索策略。而不是模拟整个过程,这是棘手的大量的实验,我们提供了一个动态规划算法来分析整个合奏的方法的行为。系综分析算法递归地计算捕获每个不同基因组的概率以及给定群体概况的预期总测序核苷酸。我们的结果表明,预期的总测序核苷酸的增长与细胞数量的$\log$成正比,与不同基因组的数量成线性比例。

英文摘要:

Acquiring genomes at single-cell resolution has many applications such as in the study of microbiota. However, deep sequencing and assembly of all of millions of cells in a sample is prohibitively costly. A property that can come to rescue is that deep sequencing of every cell should not be necessary to capture all distinct genomes, as the majority of cells are biological replicates. Biologically important samples are often sparse in that sense. In this paper, we propose an adaptive compressed method, also known as distilled sensing, to capture all distinct genomes in a sparse microbial community with reduced sequencing effort. As opposed to group testing in which the number of distinct events is often constant and sparsity is equivalent to rarity of an event, sparsity in our case means scarcity of distinct events in comparison to the data size. Previously, we introduced the problem and proposed a distilled sensing solution based on the breadth first search strategy. We simulated the whole process which constrained our ability to study the behavior of the algorithm for the entire ensemble due to its computational intensity. In this paper, we modify our previous breadth first search strategy and introduce the depth first search strategy. Instead of simulating the entire process, which is intractable for a large number of experiments, we provide a dynamic programming algorithm to analyze the behavior of the method for the entire ensemble. The ensemble analysis algorithm recursively calculates the probability of capturing every distinct genome and also the expected total sequenced nucleotides for a given population profile. Our results suggest that the expected total sequenced nucleotides grows proportional to $\log$ of the number of cells and proportional linearly with the number of distinct genomes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑