메뉴 건너뛰기




Volumn 278, Issue 5337, 1997, Pages 446-449

DNA solution of the maximal clique problem

Author keywords

[No Author keywords available]

Indexed keywords

DNA;

EID: 0030725521     PISSN: 00368075     EISSN: None     Source Type: Journal    
DOI: 10.1126/science.278.5337.446     Document Type: Article
Times cited : (565)

References (21)
  • 1
    • 0011419723 scopus 로고    scopus 로고
    • For a general discussion, see J. Casti, New Sci. 2082, 30 (1997).
    • (1997) New Sci. , vol.2082 , pp. 30
    • Casti, J.1
  • 13
    • 1842269100 scopus 로고    scopus 로고
    • note
    • 4, 0.8 mM dNTP, pH 8.8, at 25°C] to a volume of 40 μl were processed for 25 cycles (94°C for 30 s, 65°C for 30 s, and 72°C for 30 s).
  • 14
    • 1842322950 scopus 로고    scopus 로고
    • note
    • The restriction enzyme digest operation was conducted following the protocol of New England Biolabs.
  • 15
    • 1842401574 scopus 로고    scopus 로고
    • note
    • 6 (GAATTGGGTACCCTGGATCCCGCCC). The first primer was phosphorylated at the 5′ end with T4 polynucleotide kinase (New England Biolabs). (ii) The dsDNA of the PCR solution in step (i) was digested by λ exonuclease (Gibco-BRL) following the supplier's instructions. The DNA strand that contains a 5′ phosphate was thus digested, (iii) Mutagenetic M13 phage DNA (containing answer DNA) was synthesized using the ssDNA from step (ii) as primer and wild-type M13 phage DNA as template.
  • 16
    • 1842400308 scopus 로고    scopus 로고
    • note
    • Transfection, phage purification, and DNA extraction were conducted following standard protocols (20). The DNA sequencing was done by the Rockefeller University Protein/DNA Technology Center.
  • 17
    • 1842387633 scopus 로고    scopus 로고
    • note
    • 4) with 2 units of S1 nuclease at room temperature for 2 min.
  • 19
    • 10244219858 scopus 로고    scopus 로고
    • M. Chee et al., Science 274, 610 (1996).
    • (1996) Science , vol.274 , pp. 610
    • Chee, M.1
  • 21
    • 1842269099 scopus 로고    scopus 로고
    • note
    • We thank D. Boneh, who proposed the maximal clique problem and the binary number-based algorithm for solving it, and D. Thaler, who suggested the use of POA to build the data pool.


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