Multi-node graphs: A framework for multiplexed biological assays

被引:4
作者
Alon, Noga
Asodi, Vera
Cantor, Charles
Kasif, Simon
Rachlin, John
机构
[1] CALTECH, Pasadena, CA 91125 USA
[2] Tel Aviv Univ, Dept Comp Sci, Raymond & Beverly Sackler Fac Exact Sci, IL-69978 Tel Aviv, Israel
[3] Boston Univ, Dept Biomed Engn, Boston, MA 02215 USA
[4] Boston Univ, Ctr Adv Genom Technol, Boston, MA 02215 USA
[5] Harvard Univ, Sch Med, Childrens Hosp, Informat Program, Boston, MA 02115 USA
[6] Boston Univ, Dept Comp Sci, Boston, MA 02215 USA
[7] Tel Aviv Univ, Dept Math, Raymond & Beverly Sackler Fac Exact Sci, IL-69978 Tel Aviv, Israel
关键词
algorithms; combinatorics; computational molecular biology;
D O I
10.1089/cmb.2006.13.1659
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Multiplex polymerase chain reaction (PCR) is an extension of the standard PCR protocol in which primers for multiple DNA loci are pooled together within a single reaction tube, enabling simultaneous sequence amplification, thus reducing costs and saving time. Potential cost saving and throughput improvements directly depend on the level of multiplexing achieved. Designing reliable and highly multiplexed assays is challenging because primers that are pooled together in a single reaction tube may cross-hybridize, though this can be addressed either by modifying the choice of primers for one or more amplicons, or by altering the way in which DNA loci are partitioned into separate reaction tubes. In this paper, we introduce a new graph formalism called a multi-node graph, and describe its application to the analysis of multiplex PCR scalability. We show, using random multi-node graphs that the scalability of multiplex PCR is constrained by a phase transition, suggesting fundamental limits on efforts to improve the cost-effectiveness and throughput of standard multiplex PCR assays. In particular, we show that when the multiplexing level of the reaction tubes is roughly Theta(log (sn)) (where s is the number of primer pair candidates per locus and n is the number of loci to be amplified), then with very high probability we can 'cover' all loci with a valid assignment to one of the tubes in the assay. However, when the multiplexing level of the tube exceeds these bounds, there is no possible cover and moreover the size of the cover drops dramatically. Simulations using a simple greedy algorithm on real DNA data also confirm the presence of this phase transition. Our theoretical results suggest, however, that the resulting phase transition is a fundamental characteristic of the problem, implying intrinsic limits on the development of future assay design algorithms.
引用
收藏
页码:1659 / 1672
页数:14
相关论文
共 30 条
  • [21] An Eulerian path approach to DNA fragment assembly
    Pevzner, PA
    Tang, HX
    Waterman, MS
    [J]. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2001, 98 (17) : 9748 - 9753
  • [22] Computational tradeoffs in multiplex PCR assay design for SNP genotyping
    Rachlin, J
    Ding, CM
    Cantor, C
    Kasif, S
    [J]. BMC GENOMICS, 2005, 6 (1)
  • [23] MuPlex: multi-objective multiplex PCR assay design
    Rachlin, J
    Ding, CM
    Cantor, C
    Kasif, S
    [J]. NUCLEIC ACIDS RESEARCH, 2005, 33 : W544 - W547
  • [24] RACHLIN J, 2006, UNPUB BIOL CONTEXT N
  • [25] Rozen S, 2000, Methods Mol Biol, V132, P365
  • [26] Safra S, 2003, LECT NOTES COMPUT SC, V2832, P446
  • [27] Multiplexing schemes for generic SNP genotyping assays
    Sharan, R
    Gramm, J
    Yakhini, Z
    Ben-Dor, A
    [J]. JOURNAL OF COMPUTATIONAL BIOLOGY, 2005, 12 (05) : 514 - 533
  • [28] Shi MM, 2001, CLIN CHEM, V47, P164
  • [29] Sninsky J. J., 1999, PCR APPL PROTOCOLS F
  • [30] Optimized multiplex PCR: Efficiently closing a whole-genome shotgun sequencing project
    Tettelin, H
    Radune, D
    Kasif, S
    Khouri, H
    Salzberg, SL
    [J]. GENOMICS, 1999, 62 (03) : 500 - 507