메뉴 건너뛰기




Volumn 122, Issue 9, 2000, Pages 1873-1882

The arrayed primer extension method for DNA microchip analysis. Molecular computation of satisfaction problems

Author keywords

[No Author keywords available]

Indexed keywords

PRIMER DNA;

EID: 0034620765     PISSN: 00027863     EISSN: None     Source Type: Journal    
DOI: 10.1021/ja992392j     Document Type: Article
Times cited : (36)

References (67)
  • 40
    • 0345238579 scopus 로고    scopus 로고
    • Proceedings of the 2nd Annual Conference, Morgan Kaufmann: San Francisco
    • Arita, M.; Suyama, A.; Hagiya, M. Genetic Programming 1997, Proceedings of the 2nd Annual Conference, Morgan Kaufmann: San Francisco, 1998; p 457.
    • (1998) Genetic Programming 1997 , pp. 457
    • Arita, M.1    Suyama, A.2    Hagiya, M.3
  • 45
    • 33847566928 scopus 로고    scopus 로고
    • A discussion of the principles of NP-complete in this context is available from our web site: http:/Annv.chem.duke.edu/pirning.
  • 52
    • 33847559807 scopus 로고    scopus 로고
    • Lipton, R. J.; Baum, E. B., Eds.; American Mathematical Society: Providence, Rhode Island, D1MACS 27
    • Baum, E. DNA based computers; Lipton, R. J.; Baum, E. B., Eds.; American Mathematical Society: Providence, Rhode Island, D1MACS 27 1997, p 122.
    • (1997) DNA Based Computers , pp. 122
    • Baum, E.1
  • 57
    • 33847535393 scopus 로고
    • 5th Ed.; C. N. Potter: dist. Crown Publishers: New York, 1977
    • Such problems are ubiquitous. Versions of SAT best known in the lay literature include the "pork-chop problem" and " barber-shop paradox" devised by Lewis Carroll: Symbolic logic: part I, Elementary 1896, 5th Ed.; C. N. Potter: dist. Crown Publishers: New York, 1977.
    • (1896) Symbolic Logic: Part I, Elementary
    • Carroll, L.1
  • 59
    • 0343310969 scopus 로고    scopus 로고
    • note
    • n variable assignments, which can be prepared through combinatorial methods in 2n processes. Such a surface can be used in the solution of an equation involving n variables (or fewer).
  • 61
    • 0343746678 scopus 로고    scopus 로고
    • note
    • This value was obtained by measuring by confocal fluorescence microscopy the intensity of fluorescence in the spot as well as in a dark area a short distance away from the spot and taking their ratio.
  • 62
    • 85059770931 scopus 로고
    • Proceedings of the 3rd Annual ACM Symposium on the Theory of Computing; Association of Computing Machinery: New York
    • Cook, S. The Complexity ofjlieorem Proving Procedures, Proceedings of the 3rd Annual ACM Symposium on the Theory of Computing; Association of Computing Machinery: New York, 1971.
    • (1971) The Complexity Ofjlieorem Proving Procedures
    • Cook, S.1
  • 64
    • 0003037529 scopus 로고
    • Reducability among combinatorial problems
    • Miller, R. E.; Thatcher, J. W. Plenum: New York
    • Karp, R. M. "Reducability among combinatorial problems" In Miller, R. E.; Thatcher, J. W. Complexity in Computer Computations, Plenum: New York, 1972; pp 85-103.
    • (1972) Complexity in Computer Computations , pp. 85-103
    • Karp, R.M.1
  • 67
    • 0343746675 scopus 로고    scopus 로고
    • note
    • Because spotting was used instead of in situ synthesis, oligonucleotide solutions of x = 0 and y = 0 could be mixed together and immobilized in the NW quadrant. Similarly, mixtures of oligos x = 0 + y = I, x = 1 + y = 0 and x = 1 + y = 1 were spotted in the NE, SW, and SE quadrants, respectively.


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