Abstract
We present a new approach to identify the locations of critical DNA or RNA sequence signals which couples large-scale synthesis with sophisticated designs employing combinatorial group testing and balanced Gray codes. Experiments in polio and adenovirus demonstrate the efficiency and generality of this procedure. In this paper, we give a new class of consecutive positive group testing designs, which offer a better tradeoff of cost, resolution, and robustness than previous designs for signal search. Let n denote the number of distinct regions in a sequence, and d the maximum number of consecutive positives regions which can occur. We propose a design which improves on the consecutive-positive group testing designs of Colbourn. Our design completely identifies the boundaries of the positive region using t tests, where t≈log2(1.27n/d)+0.5log2(log2(1.5n/d))+d.
| Original language | English |
|---|---|
| Pages (from-to) | 368-383 |
| Number of pages | 16 |
| Journal | Algorithmica (New York) |
| Volume | 67 |
| Issue number | 3 |
| DOIs | |
| State | Published - Nov 2013 |
Keywords
- Combinatorial group testing
- Gray codes
- Non-adaptive group testing
- Synthetic biology
Fingerprint
Dive into the research topics of 'Synthetic sequence design for signal location search'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver