Synthetic Sequence Design for Signal Location Search

  • Yaw-Ling Lin
  • Charles Ward
  • Steven Skiena
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7262)


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.5 log2(log2 (1.5 n /d) ) + d.


Combinatorial group testing non-adaptive group testing Gray codes synthetic biology 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Balding, D.J., Torney, D.C.: The design of pooling experiments for screening a clone map. Fungal Genetics and Biology 21(3), 302–307 (1997)CrossRefGoogle Scholar
  2. 2.
    Bhat, G., Savage, C.: Balanced gray codes. Electronic Journal of Combinatorics 3, R25 (1996)Google Scholar
  3. 3.
    Bruno, W.J., Knill, E., Balding, D.J., Bruce, D.C., Doggett, N.A., Sawhill, W.W., Stallings, R.L., Whittaker, C.C., Torney, D.C.: Efficient pooling designs for library screening. Genomics 26(1), 21–30 (1995)CrossRefGoogle Scholar
  4. 4.
    Bugl, H., Danner, J.P., Molinari, R.J., Mulligan, J.T., Park, H.-O., Reichert, B., Roth, D.A., Wagner, R., Budowle, B., Scripp, R.M., Smith, J.A.L., Steele, S.J., Church, G., Endy, D.: Dna synthesis and biological security. Nature Biotechnology 25, 627–629 (2007)CrossRefGoogle Scholar
  5. 5.
    Chen, H.B., Hwang, F.K.: Exploring the missing link among d-separable,-separable and d-disjunct matrices. Discrete Applied Mathematics 155(5), 662–664 (2007)MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    Cheng, Y., Du, D.Z.: New constructions of one-and two-stage pooling designs. Journal of Computational Biology 15(2), 195–205 (2008)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Colbourn, C.J.: Group testing for consecutive positives. Annals of Combinatorics 3(1), 37–41 (1999)zbMATHCrossRefGoogle Scholar
  8. 8.
    Coleman, J.R., Papamichial, D., Futcher, B., Skiena, S., Mueller, S., Wimmer, E.: Virus attenuation by genome-scale changes in codon-pair bias. Science 320, 1784–1787 (2008)CrossRefGoogle Scholar
  9. 9.
    Czar, M.J., Christopher Anderson, J., Bader, J.S., Peccoud, J.: Gene synthesis demystified. Trends in Biotechnology 27(2), 63–72 (2009)CrossRefGoogle Scholar
  10. 10.
    Damaschke, P., Sheikh Muhammad, A.: Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity. In: Kutyłowski, M., Charatonik, W., Gębala, M. (eds.) FCT 2009. LNCS, vol. 5699, pp. 84–95. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  11. 11.
    Damaschke, P., Muhammad, A.S.: Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives. In: Wu, W., Daescu, O. (eds.) COCOA 2010, Part II. LNCS, vol. 6509, pp. 117–130. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  12. 12.
    Du, D., Hwang, F.: Combinatorial group testing and its applications. World Scientific Pub. Co. Inc. (2000)Google Scholar
  13. 13.
    Du, D., Hwang, F.: Pooling Designs and Nonadaptive Group Testing: Important Tools for DNA Sequencing. World Scientific (2006)Google Scholar
  14. 14.
    Eppstein, D., Goodrich, M.T., Hirschberg, D.S.: Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes. SIAM Journal on Computing 36(5), 1360–1375 (2006)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Gray, F.: Pulse code communication. US Patent 2632058, March 17 (1953)Google Scholar
  16. 16.
    Kautz, W., Singleton, R.: Nonrandom binary superimposed codes. IEEE Transactions on Information Theory 10(4), 363–377 (1964)zbMATHCrossRefGoogle Scholar
  17. 17.
    Knuth, D.: The Art of Computer Programming, Volume 4 Fascicle 3: Generating All Combinations and Partitions. Addison Wesley (2005)Google Scholar
  18. 18.
    Lin, Y.-L., Ward, C., Jain, B., Skiena, S.: Constructing Orthogonal de Bruijn Sequences. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol. 6844, pp. 595–606. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  19. 19.
    Macula, A.J., Reuter, G.R.: Simplified searching for two defects. Journal of Statistical Planning and Inference 66(1), 77–82 (1998)MathSciNetzbMATHCrossRefGoogle Scholar
  20. 20.
    Mueller, S., Coleman, R., Papamichail, D., Ward, C., Nimnual, A., Futcher, B., Skiena, S., Wimmer, E.: Live attenuated influenza vaccines by computer-aided rational design. Nature Biotechnology 28 (2010)Google Scholar
  21. 21.
    Müller, M., Jimbo, M.: Consecutive positive detectable matrices and group testing for consecutive positives. Discrete Mathematics 279(1-3), 369–381 (2004)MathSciNetzbMATHCrossRefGoogle Scholar
  22. 22.
    Müller, M., Jimbo, M.: Cyclic sequences of k-subsets with distinct consecutive unions. Discrete Mathematics 308(2-3), 457–464 (2008)MathSciNetzbMATHCrossRefGoogle Scholar
  23. 23.
    Pemmaraju, S., Skiena, S.: Computational Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Cambridge University Press, New York (2003)zbMATHGoogle Scholar
  24. 24.
    Savage, C.: A survey of combinatorial gray codes. SIAM Review 39, 605–629 (1997)MathSciNetzbMATHCrossRefGoogle Scholar
  25. 25.
    Schlaghoff, J., Triesch, E.: Improved results for competitive group testing. Combinatorics, Probability and Computing 14(1-2), 191–202 (2005)MathSciNetzbMATHCrossRefGoogle Scholar
  26. 26.
    Shields, I., Shields, B.J., Savage, C.D.: An update on the middle levels problem. Discrete Mathematics 309(17), 5271–5277 (2009)MathSciNetzbMATHCrossRefGoogle Scholar
  27. 27.
    Shimada, M., Amano, K.: A note on the middle levels conjecture. Arxiv preprint arXiv:0912.4564 (2009)Google Scholar
  28. 28.
    Sitaraman, V., Hearing, P., Mueller, S., Ward, C., Skiena, S., Wimmer, E., Bahou, W.: Genetically re-engineered aav rep78 identifies sequence-restricted inhibitory regions affecting adenoviral replication. American Society of Gene and Cell Therapy 13th Annual Meeting (2010)Google Scholar
  29. 29.
    Song, Y., Paul, A., Ward, C., Mueller, S., Futcher, B., Skiena, S., Wimmer, E.: Identification of cis-acting elements in the coding sequence of the poliovirus rna polymerase using computer generated designs and synthetic dna synthesis (manuscript in preparation)Google Scholar
  30. 30.
    Wilf, H.: Combinatorial Algorithms: an update. SIAM, Philadelphia (1989)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Yaw-Ling Lin
    • 1
  • Charles Ward
    • 2
  • Steven Skiena
    • 2
  1. 1.Department of Computer Science and Information EngineeringProvidence UniversityTaichungTaiwan
  2. 2.Department of Computer ScienceStony Brook UniversityStony BrookUSA

Personalised recommendations