메뉴 건너뛰기




Volumn 7262 LNBI, Issue , 2012, Pages 165-179

Synthetic sequence design for signal location search

Author keywords

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

Indexed keywords

COMBINATORIAL GROUP TESTING; GRAY CODES; GROUP TESTING; LARGE SCALE SYNTHESIS; POSITIVE REGION; RNA SEQUENCES; SIGNAL LOCATION; SYNTHETIC BIOLOGY; SYNTHETIC SEQUENCE; T-TESTS;

EID: 84860826720     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-29627-7_15     Document Type: Conference Paper
Times cited : (5)

References (30)
  • 1
    • 0031170571 scopus 로고    scopus 로고
    • The design of pooling experiments for screening a clone map
    • 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)
    • (1997) Fungal Genetics and Biology , vol.21 , Issue.3 , pp. 302-307
    • Balding, D.J.1    Torney, D.C.2
  • 5
    • 33846817132 scopus 로고    scopus 로고
    • Exploring the missing link among d-separable,-separable and d-disjunct matrices
    • 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)
    • (2007) Discrete Applied Mathematics , vol.155 , Issue.5 , pp. 662-664
    • Chen, H.B.1    Hwang, F.K.2
  • 6
    • 40049103916 scopus 로고    scopus 로고
    • New constructions of one-and two-stage pooling designs
    • Cheng, Y., Du, D.Z.: New constructions of one-and two-stage pooling designs. Journal of Computational Biology 15(2), 195-205 (2008)
    • (2008) Journal of Computational Biology , vol.15 , Issue.2 , pp. 195-205
    • Cheng, Y.1    Du, D.Z.2
  • 7
    • 1342274504 scopus 로고    scopus 로고
    • Group testing for consecutive positives
    • Colbourn, C.J.: Group testing for consecutive positives. Annals of Combinatorics 3(1), 37-41 (1999)
    • (1999) Annals of Combinatorics , vol.3 , Issue.1 , pp. 37-41
    • Colbourn, C.J.1
  • 10
    • 70350666512 scopus 로고    scopus 로고
    • Competitive group testing and learning hidden vertex covers with minimum adaptivity
    • Kutylowski, M., Charatonik, W., Gebala, M. (eds.) Springer, Heidelberg
    • Damaschke, P., Sheikh Muhammad, A.: Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity. In: Kutylowski, M., Charatonik, W., Gebala, M. (eds.) FCT 2009. LNCS, vol. 5699, pp. 84-95. Springer, Heidelberg (2009)
    • (2009) FCT 2009. LNCS , vol.5699 , pp. 84-95
    • Damaschke, P.1    Sheikh Muhammad, A.2
  • 11
    • 78650838751 scopus 로고    scopus 로고
    • Bounds for nonadaptive group tests to estimate the amount of defectives
    • Wu, W., Daescu, O. (eds.). Springer, Heidelberg
    • 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)
    • (2010) COCOA 2010, Part II. LNCS , vol.6509 , pp. 117-130
    • Damaschke, P.1    Muhammad, A.S.2
  • 13
    • 80051870326 scopus 로고    scopus 로고
    • Pooling designs and nonadaptive group testing: Important tools for DNA sequencing
    • Du, D., Hwang, F.: Pooling Designs and Nonadaptive Group Testing: Important Tools for DNA Sequencing. World Scientific (2006)
    • (2006) World Scientific
    • Du, D.1    Hwang, F.2
  • 14
    • 35449004128 scopus 로고    scopus 로고
    • Improved combinatorial group testing algorithms for real-world problem sizes
    • 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)
    • (2006) SIAM Journal on Computing , vol.36 , Issue.5 , pp. 1360-1375
    • Eppstein, D.1    Goodrich, M.T.2    Hirschberg, D.S.3
  • 15
    • 0003295504 scopus 로고
    • Pulse code communication
    • March 17
    • Gray, F.: Pulse code communication. US Patent 2632058, March 17 (1953)
    • (1953) US Patent 2632058
    • Gray, F.1
  • 18
    • 80052130066 scopus 로고    scopus 로고
    • Constructing orthogonal de bruijn sequences
    • Dehne, F., Iacono, J., Sack, J.-R. (eds.), Springer, Heidelberg
    • 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)
    • (2011) WADS 2011. LNCS , vol.6844 , pp. 595-606
    • Lin, Y.-L.1    Ward, C.2    Jain, B.3    Skiena, S.4
  • 21
    • 1342329719 scopus 로고    scopus 로고
    • Consecutive positive detectable matrices and group testing for consecutive positives
    • Müller, M., Jimbo, M.: Consecutive positive detectable matrices and group testing for consecutive positives. Discrete Mathematics 279(1-3), 369-381 (2004)
    • (2004) Discrete Mathematics , vol.279 , Issue.1-3 , pp. 369-381
    • Müller, M.1    Jimbo, M.2
  • 22
    • 36249009671 scopus 로고    scopus 로고
    • Cyclic sequences of k-subsets with distinct consecutive unions
    • Müller, M., Jimbo, M.: Cyclic sequences of k-subsets with distinct consecutive unions. Discrete Mathematics 308(2-3), 457-464 (2008)
    • (2008) Discrete Mathematics , vol.308 , Issue.2-3 , pp. 457-464
    • Müller, M.1    Jimbo, M.2
  • 24
    • 0031353426 scopus 로고    scopus 로고
    • A survey of combinatorial gray codes
    • Savage, C.: A survey of combinatorial gray codes. SIAM Review 39, 605-629 (1997)
    • (1997) SIAM Review , vol.39 , pp. 605-629
    • Savage, C.1
  • 26
  • 30
    • 79953653351 scopus 로고
    • Combinatorial Algorithms: An update
    • Wilf, H.: Combinatorial Algorithms: An update. SIAM, Philadelphia (1989)
    • (1989) SIAM, Philadelphia
    • Wilf, H.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.