> For the complete documentation index, see [llms.txt](https://cmo-ci.gitbook.io/access-quality-control-v1/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://cmo-ci.gitbook.io/access-quality-control-v1/umi-family-sizes-simplex-reads.md).

# UMI family sizes (Simplex reads)

Understanding the frequency of UMI families of different read counts

![](https://2763969089-files.gitbook.io/~/files/v0/b/gitbook-legacy-files/o/assets%2F-M52gq1rRSDQOKMQGEuR%2F-M9Z39Nd7c6cJRknLQBm%2F-M9Z6moXE-PQxOyhFTbD%2FScreen%20Shot%202020-06-11%20at%2012.03.15%20PM.png?alt=media\&token=991d3975-ac14-41b9-b92a-21253a35064b)

**Theoretical Method**

In this plot we investigate the number of families of each discrete size for simplex reads, which consist of 3 or more read pairs from one of the two strands.  

**Technical Methods**

* Tools Used:
  * Marianas
  * make\_umi\_qc\_tables.sh
* Input
  * collapsed\_R1\_.fastq
  * collapsed\_R2\_.fastq
  * MSK-ACCESS-v1\_0-A-on-target-positions.txt
  * MSK-ACCESS-v1\_0-B-on-target-positions.txt
* Output
  * family-sizes.txt

**Interpretations**

This graph begins at family sizes of 3, for which the largest number of families should occur, and drops off after that.