13.01.2013 Views

Calcium-Binding Protein Protocols Calcium-Binding Protein Protocols

Calcium-Binding Protein Protocols Calcium-Binding Protein Protocols

Calcium-Binding Protein Protocols Calcium-Binding Protein Protocols

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Multiple Sequence Alignment 233<br />

ensure that the quality of the final product remains high at reasonable levels of<br />

pairwise sequence similarities (>30% sequence identity). However, as the<br />

degree of sequence similarity decreases below 25%, it generally becomes difficult<br />

to separate a legitimate “signal,” or sequence conservation, from “noise,”<br />

or apparent similarities between motifs that are, in fact, unrelated and should<br />

not be matched. In-depth treatment of popular methods available for aligning<br />

sequences is available elsewhere (e.g., ref. 14) as this is beyond the scope of<br />

this chapter. The alignments described here are based on the dynamic programming<br />

(DP) algorithm as implemented in the program PRALINE (14) and the<br />

popular method CLUSTALW (15) as representative programs.<br />

This chapter will concentrate on specific methods available for sequence<br />

alignment of calcium-binding proteins. One particularly important question to<br />

address in the examination of these proteins is which part of the polypeptide<br />

chain one wishes to align and the degree of similarity shared with other protein<br />

sequences under consideration. If the protein of interest belongs to a particular<br />

subfamily in which the topology is roughly the same, as is the case for the<br />

calmodulin and troponin C families, then a global alignment program would be<br />

ideal. Global-alignment methods align input sequences over their full length<br />

and can be confused if, for example, some sequences contain unrelated domains<br />

in addition to the calcium-binding domain. Therefore, if sequences are being<br />

compared of very different lengths and topologies (e.g., the entire family of<br />

EF-hand or all C2-domain proteins) and the region of interest is only the calcium-binding<br />

area, then a local alignment algorithm would be judicious. Both<br />

of these situations will be addressed in this protocol. Additionally, some techniques<br />

to create phylogenetic trees will be presented and specific results of<br />

sequence alignments will be given in the notes to provide simple, but concrete,<br />

examples (see Subheading 4.2.). Throughout, it will be assumed that the<br />

researcher has access to the World Wide Web, although it is certainly possible<br />

to perform alignments if sequence databases and alignment programs are available<br />

locally. A compilation of Web sites holding methods and/or databases<br />

important for this chapter is given in Table 2.<br />

2. Materials<br />

1. A sequence (or set of sequences) for alignment known as the target sequence<br />

(set).<br />

2. Access to one or more sequence databases to search against, such as SWISS-<br />

PROT (16), EMBL (17), GENBANK (18), or PIR (19).<br />

3. An alignment program suitable for aligning the sequences of interest such as<br />

PRALINE, or CLUSTALX (20) (see Note 1).<br />

4. Any additional biochemical or structural evidence known about the sequence,<br />

such as metal-binding sites or secondary structure information.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!