必备蛋白质的结构分析流程教程Word下载.docx

1、广告cnlics（站内联系TA）实验数据许多实验数据可以辅助结构预测过程，包括：二硫键，固定了半胱氨酸的空间位置光谱数据，可以提供蛋白的二级结构内容定位突变研究，可以发现活性或结合位点的残基蛋白酶切割位点，翻译后修饰如磷酸化或糖基化提示了残基必须是暴露的其他预测时，必须清楚所有的数据。必须时刻考虑：预测与实验结果是否一致？如果不是，就有必要修改做法。蛋白序列数据对蛋白序列的初步分析有一定价值。例如，如果蛋白是直接来自基因预测，就可能包含多个结构域。更严重的是，可能会包含不太可能是球形或可溶性的区域。此流程图假设你的蛋白是可溶的，可能是一个结构域并不包含非球形结构域。需要考虑以下方面：是跨膜蛋白

2、或者包含跨膜片段吗？有许多方法预测这些片段，包括： o TMAP （EMBL） o PredictProtein （EMBL/Columbia） o TMHMM （CBS, Denmark） o TMpred （Baylor College） o DAS （Stockholm）如果包含卷曲（coiled-coils）可以在COILS server 预测coiled coils 或者下载 COILS 程序（最近已经重写，注意GCG程序包里包含了COILS的一个版本）蛋白包含低复杂性区域？蛋白经常含有数个聚谷氨酸或聚丝氨酸区，这些地方不容易预测。可以用SEG（GCG程序包里包含了一个版本的SEG程

3、序）检查 。如果出现以上一种情况，就应该将序列打成碎片，或忽略序列中的特定区段，等等。这个问题与细胞定位结构域相关。搜索序列数据库分析任何新序列的第一步显然是搜索序列数据库以发现同源序列。这样的搜索可以在任何地方或者在任何计算机上完成。而且，有许多WEB服务器可以进行此类搜索，可以输入或粘贴序列到服务器上并交互式地接收结果。序列搜索也有许多方法，目前最有名的是BLAST程序。可以容易得到在本地运行的版本（从 NCBI 或者 Washington University），也有许多的WEB页面允许对多基因或蛋白质序列的数据库比较蛋白质或DNA序列，仅举几个例子：National Center fo

4、r Biotechnology Information （USA） SearchesEuropean Bioinformatics Institute （UK） SearchesBLAST search through SBASE （domain database; ICGEB, Trieste）还有更多的站点最近序列比较的重要进展是发展了gapped BLAST 和PSI-BLAST （position specific interated BLAST），二者均使BLAST更敏感，后者通过选取一条搜索结果，建立模式（profile），然后用再它搜索数据库寻找其他同源序列（这个过程可以一直重复

5、到发现不了新的序列为止），可以探测进化距离非常远的同源序列。很重要的一点是，在利用下面章节方法之前，通过PSI-BLAST把蛋白质序列和数据库比较，找寻是否有已知结构。将一条序列和数据库比较的其他方法有：FASTA软件包 （William Pearson, University of Virginia, USA）SCANPS （Geoff Barton, European Bioinformatics Institute, UK）BLITZ （Compugens fast Smith Waterman search）其他方法.It is also possible to use multipl

6、e sequence information to perform more sensitive searches. Essentially this involves building a profile from some kind of multiple sequence alignment. A profile essentially gives a score for each type of amino acid at each position in the sequence, and generally makes searches more sentive. Tools fo

7、r doing this include:PSI-BLAST （NCBI, Washington）ProfileScan Server （ISREC, Geneva）HMMER 隐马氏模型（Sean Eddy， Washington University）Wise package （Ewan Birney， Sanger Centre；用于蛋白质对DNA的比较）A different approach for incorporating multiple sequence information into a database search is to use a MOTIF. Instead

8、 of giving every amino acid some kind of score at every position in an alignment, a motif ignores all but the most invariant positions in an alignment, and just describes the key residues that are conserved and define the family. Sometimes this is called a signature. For example, H-x-x-G-x（5）-H-x（3）

9、- describes a family of DNA binding proteins. It can be translated as histidine, followed by either a phenylalanine or tryptophan, followed by an amino acid （x）, followed by leucine, isoleucine, valine or methionine, followed by any amino acid （x）, followed by glycine,. .PROSITE （ExPASy Geneva） cont

10、ains a huge number of such patterns, and several sites allow you to search these data:ExPASyEBIIt is best to search a few different databases in order to find as many homologues as possible. A very important thing to do, and one which is sometimes overlooked, is to compare any new sequence to a data

11、base of sequences for which 3D structure information is available. Whether or not your sequence is homologous to a protein of known 3D structure is not obvious in the output from many searches of large sequence databases. Moreover, if the homology is weak, the similarity may not be apparent at all d

12、uring the search through a larger database.One last thing to remember is that one can save a lot of time by making use of pre-prepared protein alignments. Many of these alignments are hand edited by experts on the particular protein families, and thus represent probably the best alignment one can ge

13、t given the data they contain （i.e. they are not always as up to date as the most recent sequence databases）. These databases include:SMART （Oxford/EMBL）PFAM （Sanger Centre/Wash-U/Karolinska Intitutet）COGS （NCBI）PRINTS （UCL/Manchester）BLOCKS （Fred Hutchinson Cancer Research Centre, Seatle）SBASE （ICG

14、EB, Trieste）通常把蛋白质序列和数据比较都有很多的方法，这些对于识别结构域非常有用。确定结构域If you have a sequence of more than about 500 amino acids, you can be nearly certain that it will be divided into discrete functional domains. If possible, it is preferable to split such large proteins up and consider each domain separately. You ca

15、n predict the locatation of domains in a few different ways. The methods below are given （approximately） from most to least confident. If homology to other sequences occurs only over a portion of the probe sequence and the other sequences are whole （i.e. not partial sequences）, then this provides th

16、e strongest evidence for domain structure. You can either do database searches yourself or make use of well-curated, pre-defined databases of protein domains. Searches of these databases （see links below） will often assign domains easily.o SMART （Oxford/EMBL） PFAM （Sanger Centre/Wash-U/Karolinska In

17、titutet） COGS （NCBI） PRINTS （UCL/Manchester） BLOCKS （Fred Hutchinson Cancer Research Centre, Seatle） SBASE （ICGEB, Trieste）You can also find domain descriptions in the annotations in SWISSPROT. Regions of low-complexity often separate domains in multidomain proteins. Long stretches of repeated resid

18、ues, particularly Proline, Glutamine, Serine or Threonine often indicate linker sequences and are usually a good place to split proteins into domains.Low complexity regions can be defined using the program SEG which is generally available in most BLAST distributions or web servers （a version of SEG

19、is also contained within the GCG suite of programs）. Transmembrane segments are also very good dividing points, since they can easily separate extracellular from intracellular domains. There are many methods for predicting these segments, including: TMAP （EMBL） PredictProtein （EMBL/Columbia） TMHMM （

20、CBS, Denmark） TMpred （Baylor College） DAS （Stockholm） Something else to consider are the presence of coiled-coils. These unusual structural features sometimes （but not always） indicate where proteins can be divided into domains. You can predict coiled coils at the COILS server or you can download th

21、e COILS program （recently re-written by me of all people; a version of SEG is also contained within the GCG suite of programs）. Secondary structure prediction methods （see below） will often predict regions of proteins to have different protein structural classes. For example one region of sequence m

22、ay be predicted to contain only lpha helices and another to contain only beta sheets. These can often, though not always, suggest likely domain structure （e.g. an all alpha domain and an all beta domain）If you have separated a sequence into domains, then it is very important to repeat all the databa

23、se searches and alignments using the domains separately. Searches with sequences containing several domains may not find all sub-homologies, particularly if the domains are abundent in the database （e.g. kinases, SH2 domains, etc.）. There may also be hidden domains. For example if there is a stretch

24、 of 80 amino acids with few homologues nested in between a kinase and an SH2 domain, then you may miss matches found when searching the whole sequence against a database.Anyway, here is my slide from the talk related to this subject:多序列比对Regardless of the outcome of your searches, you will want a mu

25、ltiple sequence alignment containing your sequence and all the homologues you have found above.Some sites for performing multiple alignment: EBI （UK） Clustalw Server IBCP （France） Multalin Server IBCP （France） Clustalw Server IBCP （France） Combined Multalin/Clustalw MSA （USA） Server BCM Multiple Seq

26、uence Alignment ClustalW Sever （USA）If you are going to do a lot of alignments, then it is probably best to get your own copy of one of many programs, some FTP sites for some of these are: HMMer （HMM method, Wash U） SAM （HMM method, Santa Cruz） ClustalW （EBI,UK） ClustalW （USA） MSA （USA） AMPS （UK）Not

27、e that PileUp is contained within the GCG commercial package. Most institutions with people doing this sort of work will have access to this software, so ask around if you want to use it.Probably the most important advance since these pages first appeared are Hidden Markov Models for sequence alignm

28、ent. Several methods are listed above.Alignments can provide: Information as to protein domain structure The location of residues likely to be involved in protein function Information of residues likely to be buried in the protein core or exposed to solvent More information than a single sequence fo

29、r applications like homology modelling and secondary structure prediction.Some tips Dont just take everything found in the searches and feed them directly into the alignment program. Searches will almost always return matches that do not indicate a significant sequence similarity. Look through the o

30、utput carefully and throw things out if they dont appear to be a member of the sequence family. Inclusion of non-members in your alignment will confuse things and likely lead to errors later. Remember that the programs for aligning sequences arent perfect, and do not always provide the best alignment. This is particularly so for large families of proteins with low sequence identities. If you can see a better way of