ジーントラップについて

トップ > チップス > ジーントラップについて
2012-02-13, geneTrapping

*Gene Trap **What is a gene trap? >Gene trapping creates random insertional mutations in the genome that are immediately accessible to molecular characterization. >Genetrappingは分子の特徴に関連のあるゲノムに突然変異を発生させます。

>Gene trap vectors contain a promoterless reporter gene and/or selectable marker which is activated upon insertion within an endogenous gene, hence, "gene trapping". >Genetrappingは報告を促進するもののない遺伝子や内部の遺伝子への挿入によって選択可能なマーカーという方向性を持ちます。それ故「Gene Trapping」と呼ばれるのです。

>The gene trap vector itself provides a DNA tag for the rapid identification of the disrupted locus. >GenetrapによってDNA内の分裂部位の速やかな同定が可能になります。

>When carried out in mouse embryonic stem (ES) cells, gene trap insertions can be transmitted to the germline of mice to examine the function of the trapped gene in vivo.

>In contrast to other mutagenesis methods such as the use of ENU, gene traps generally induce null mutations.

>Gene trapping is a rapid and cost-efficient method that is ideally suited for large-scale mutagenesis of the mammalian genome.

>Mutations are relatively inexpensive to create and mutant cell lines are easily stored and distributed.

>The IGTC is committed to creating a large public resource of gene trap insertions that can be used to analyse gene function in mice.

>This resource is intended to provide all investigators equal access to knock-out mice and thereby accelerate the rate by which new mutant strains of mice can be generated for research purposes.

**Links ***The International Gene Trap Consortium - {link:http://www.igtc.ca/index.html} ***The Sanger Institute - {link:http://www.sanger.ac.uk/} ***BayGenomics - {link:http://baygenomics.ucsf.edu/} ***Mouse Genome Informatics - {link:http://www.informatics.jax.org/} ***CARD R-BASE - {link:http://cardb.cc.kumamoto-u.ac.jp/transgenic/} ***GenomeNet - {link:http://www.genome.ad.jp/} ***BLAST -{link:http://wwwitblpg.apr.jaeri.go.jp/itblpg/bioedu/blast/Top.html,blastの動作原理}

**FASTA Format ">"で始まる行はコメント。任意の位置に空白または改行を挿入可能。

**Smith-Waterman Algorithm ***score :s(a,b)\{ : if(a == b) return 1; : else return 0; :\}

:F(i,j)\{ : return max(0, : F(i-1,j-1)+s(xi,yi), : F(i-1,j) - d, : F(i,j-1) - d); :\} ※egtc.jpはd=1で実装。

***example ATCAとTATCGAGTの2本の配列のアライメントを求める。

: ATCA :T0100 :A1001 :T0200 :C0030 :G0023 :A1013 :G0002 :T0101

スコアが最も高いペアのうち最下端から逆向きに走査する。

:X = ATC-A :Y = ATCGA

この記事は役に立ちましたか?