http://rdf.ncbi.nlm.nih.gov/pubchem/patent/JP-2006320307-A
Outgoing Links
Predicate | Object |
---|---|
assignee | http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_80787665b837ed3eb503bbcd27c0043a |
classificationCPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/C12Q1-6823 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/C12Q1-6869 |
classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/C12N15-09 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/C12Q1-68 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/C12Q1-48 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/C12Q1-42 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/C12Q1-34 |
filingDate | 2005-07-19-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
inventor | http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_f3f3d745dd8e089adcaf90b329850d85 http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_f87844964e9d0dfb7d758af011f75981 http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_2a3a06c3206ff0bb94506ab12baf6fe1 |
publicationDate | 2006-11-30-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
publicationNumber | JP-2006320307-A |
titleOfInvention | Base sequence inspection method |
abstract | PROBLEM TO BE SOLVED: To provide a simple base sequence inspection method that is inexpensive, has good reproducibility, and in particular, can detect a plurality of mutation sites in one reaction tank. SOLUTION: At least one of four ddNTPs corresponding to the base AGTC or a derivative thereof is added to a reaction vessel containing a nucleic acid sample to synthesize a complementary strand, extend the target site by one base, and from the resulting pyrophosphate A chemiluminescence reaction is performed using the generated ATP as a reaction substrate, the presence or absence of complementary strand synthesis is determined by the chemiluminescence, and the base sequence of the target site is determined. [Selection] Figure 1 |
priorityDate | 2005-04-21-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
type | http://data.epo.org/linked-data/def/patent/Publication |
Incoming Links
Total number of triples: 213.