2009
DOI: 10.1101/gr.092957.109
|View full text |Cite
|
Sign up to set email alerts
|

DNA Sudoku—harnessing high-throughput sequencing for multiplexed specimen analysis

Abstract: Next-generation sequencers have sufficient power to analyze simultaneously DNAs from many different specimens, a practice known as multiplexing. Such schemes rely on the ability to associate each sequence read with the specimen from which it was derived. The current practice of appending molecular barcodes prior to pooling is practical for parallel analysis of up to many dozen samples. Here, we report a strategy that permits simultaneous analysis of tens of thousands of specimens. Our approach relies on the us… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

2
187
0

Year Published

2010
2010
2020
2020

Publication Types

Select...
7
2
1

Relationship

1
9

Authors

Journals

citations
Cited by 147 publications
(189 citation statements)
references
References 26 publications
2
187
0
Order By: Relevance
“…The extraction of as much statistical information as possible at cost as low as possible has therefore already attracted considerable interest. See, for instance, Jiang et al (2009) for the modeling of sequencing errors and Erlich et al (2009) for the efficient tagging of sequences.…”
Section: N Ext Generation Sequencing (Ngs) Is About Tomentioning
confidence: 99%
“…The extraction of as much statistical information as possible at cost as low as possible has therefore already attracted considerable interest. See, for instance, Jiang et al (2009) for the modeling of sequencing errors and Erlich et al (2009) for the efficient tagging of sequences.…”
Section: N Ext Generation Sequencing (Ngs) Is About Tomentioning
confidence: 99%
“…Multiplexed scheme (Erlich et al, 2009) In this scheme, several pooling groups are created and the individuals are assigned to pools in each group by taking use of the Chinese remainder, one of the most ancient and fundamental in number theory (Andrews 1994;Ding et al 1996;Cormen et al 2001). To create a pooling groups design, the rule of pooling for group is = , which brings the , + , + , individuals to the th pools of group , where < and = , , .…”
Section: Shifted-transversal Designmentioning
confidence: 99%
“…In a previous work, by Prabhu and Pe'er [2] , overlapping pools were used, elegantly designed based on Error-Correcting-Codes, enabling the detection of only a single carrier. In another work by Erlich et al [3], a pooling strategy based on the Chinese-Reminder Theorem was employed to solve a slightly different problem. These designs offer a significant saving in resources, as they enable genotype reconstruction for N individuals, by using only O(log N ) or O( √ N ) pools, respectively.…”
Section: Introductionmentioning
confidence: 99%