Assignment 11

Your name:
Your email address:

Note: To do these exercises you need to install seaview on your computer.

Download Seaview (see computer lab #8). The latest versions of the seaview program available for different platforms are here.

If you're doing this exercise from home, you may need to have WINZIP or STUFF-IT expander installed (read the help manuals to learn how to use these programs) - UConn's ftp server has copies of these programs in the restricted folder (only accessible from within UConn).


Exercise 1:

Long Branch Attraction (LBA) is a serious problem in phylogenetic reconstruction. LBA denotes the fact that long branches tend to be grouped together with significant support, even though the organisms representing the long branches did not share more recent common ancestry. The support usually is measured through bootstrap support values for the different trees. We have simulated the evolution of 4 sequences (named A,B,C,D) according to the following tree:

Files containing these sequences in multiple sequence fasta format were generated and named according to the length chosen for the two long branches (all scaled in substitutions per site). For the simulation we assumed that the Among Site Rate Variation could be described with a gamma distribution that has a shape factor of 1 (equal to an exponential distribution).

These files are HERE (open the folder, then ctrl click on the individual files to save them into a folder on your computer).

Your task is to explore the sensitivity of different phylogenetic reconstruction algorithms towards LBA. At the minimum you should use protein parsimony and one protein distance matrix analysis approach. In this case we know that the sequences are aligned as given; however, you to explore the effect that the alignment algorithm has on LBA, we can align them before phylogenetic reconstruction. To keep track of things, name the files accordingly.

NOTE I: If you want to explore the effect of alignment, it might be a good idea to use seaview and muscle as alignment program - especially for the more divergent sequences, clustalx takes a very long time. We will use the GUI provided in seaview.

Note II: You can divide the labor with your neighbor, distributing different sequences to different students.

We will use programs as implemented in SEAVIEW

1A: To test parsimony, choose the files with x = 0.1, 0.3, 1, 3, 10.

How long are the sequences before and after alignment with muscle - the default in the align menu of seaview)?

For each of the datasets, use the tree menu in seaview, select parsimony, uncheck "ignore all gap sites", check "gaps as unknown states", check "bootstrap with 100 replicates". (Note: If you are interested in the best parsimony tree, then you want to use the original dataset (not bootstrapped) and randomize the input order for several independent heuristic searches, if you do a bootstrap analysis, repeated heuristic searches for each dataset are not worth the time.)

In the following box list the files that you chose, aligned or as provided, the bootstrap support for the correct tree, and the support for the LBA tree:

1B) Explore a distance matrix based approach with respect to LBA (Neighbor joining using Poisson corrected or observed distances work well). Depending on the settings, these might be less sensitive to LBA. x = 0.3, 3, 30, 300 are good choices to explore.

In the following box list the parameters you selected in seaview, the files that you chose (aligned or as provided), and for each file indicate the bootstrap support for the correct tree, and the support for the LBA tree:


1C (optional) Explore the sensitivity of phyml towards LBA. This only works on a fast computer - either transfer the sequences to the cluster, login, qlogin and start the program by typing phyml at the command line, or use seaview on your own computer.

In the following box list give the parameters you chose for phyml, the files that you choose, indicate if you aligned them or used them as provided, and for each file give the support value for the correct tree, and the support for the LBA tree:


2. (This is the last assignment from last week. Please complete if time permits and you didn't complete it last week)

PHYLIP is a collection of programs for phylogenetic analyses written by Joe Felsenstein. The programs are freely available (including source code), and can be used on a variety of different operating system. The programs are modular. Different modules exist to create bootstrap samples, calculate distance matrices and calculate trees from the distance matrices (Fitch and Neighbor), calculate consensus trees, etc.. All programs either use files called infile or intree, or alternatively the user needs to provide the file name.

We will use the sequences from last week exercise testseq1b.txt (the challenges in the dataset are (a) two of the sequences contain inteins with have a higher substitution rate than the exteins, resulting in large distances between the two sequences; and (b) the catalytic subunit from Borrelia is on a long branch, which tends to attract the "outgroup" sequence (the flagellar assembly ATPases from Salmonella).

We will use the program protpars as implemented in seaview (skip the next paragraph).

This paragraph has comments on phylip that you can safely ignore for now: If you use protpars directly (without the seqview interface), note that phylip by default treats gaps as a 21st character. If you want to treat the gap as missing data, you need to replace the gap symbol with "?"'s. In case you want to use one of the programs on your own, you need to read the excellent manuals that come with the software. Download PHYLIP from HERE. Drag the "phylip-3.68" folder to your Desktop. (The original download location is here for PCs and Macs.)

To calculate a phylogenetic tree from the aligned sequences using protein parsimony, open seaview by double clicking, and drag the file into alignment window.

Align the sequences using muscle. (click on align, then align all).

In the trees menu select parsimony. Uncheck "ignore all gap sites" and check "gaps as unknown state. To do a more thorough search for the tree that explains the data with the least number of substitutions, select "randomize seq order" 5 times provides a reasonable number of starting points for the heuristic search.

How are the fungal sequences resolved? (What does this tell us about parsimony and missing data?)
Where does the Salmonella sequence go? (This is as expected, parsimony analyses are very sensitive to the Long Branch Attraction (LBA)).

Seaview also allows calculating trees using the maximum likelihood (ml) principle. The ml tree is the tree under which the sequence alignment has the highest probability. To calculate the ml tree for a sequence alignment, select phyml under trees, and run the program with the default settings. (This might take some time, when I calculated my first ml tree for 12 sequences, it took over a week on a UNIX cluster, and the model for sequence evolution was much simpler.).
How does the ml tree compare to the parsimony and neighbor joining trees?


If this takes too long on your iMacs, and you have still time and energy, load one of the trees from assignment 1 (the one with correction for multiple substitutions and without excluding gap positions works well) into Figtree, and explore the different display and annotation options.
Select NODE under selection mode (in the header), click on the branch where you want to place the root, then click on the re-root tool in the header.

Click on clade in the selection mode, and select the different paralogs and color the branches in different colors.

Select the eukaryotic clades and display it in cartoon version (one after the other).

Rotate works as in njplot. (Careful with the highlight feature, it sometimes gives unexpected results.)


Send email to your instructor (and yourself) upon submit
Send email to yourself only upon submit (as a backup)
Show summary upon submit but do not send email to anyone.