title: Ensemble analysis of adaptive compressed genome sequencing strategies.
abstract: BACKGROUND
  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.
  
  
  RESULTS
  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. The probability of missing a genome depends on its abundance and the ratio of its size over the maximum genome size in the sample. The modified resource allocation method accommodates a parameter to control that probability.
  
  
  BACKGROUND
  The squeezambler 2.0 C++ source code is available at http://sourceforge.net/projects/hyda/.
authors.forename: Zeinab
authors.initials: Z
authors.lastname: Taghavi
mesh_terms: D000465:Algorithms; D001419:Bacteria / Q000235:genetics*; D044962:Data Compression / Q000191:economics / Q000379:methods*; D016680:Genome, Bacterial; D059014:High-Throughput Nucleotide Sequencing / Q000191:economics / Q000379:methods; D056186:Metagenomics / Q000191:economics / Q000379:methods*; D011336:Probability; D017422:Sequence Analysis, DNA / Q000191:economics / Q000379:methods*