Phylogenetics: Simulating sequence data
|EEB 5349: Phylogenetics|
by Kevin Keegan
The goal of this lab is to gain experience simulating DNA sequence data using PAUP*, which can be useful in testing null hypotheses of interest (parametric bootstrapping) as well as testing the robustness of models to violations of their assumptions and testing the correctness of software and algorithms. PAUP* is a relatively new way to simulate sequence data. The old workhorse for DNA simulations in phylogenetics is Andrew Rambaut's program seq-gen, which is still available (and still as useful as it always was).
The development of models and algorithms of any kind requires testing to see how they perform. All models and algorithms make assumptions: they take the infinite complexity of nature and distill them into few components that the maker of the model/algorithm assumes are important. With models of DNA evolution and phylogenetic inference algorithms, one important way of testing the capability of a model/algorithm is by simulating DNA sequence data based on a known phylogeny, and seeing how the model/algorithm performs. If the model/algorithm allows for the recovery of the known or "true" phylogeny then we can rest assured that our model/algorithm is relatively accurate in its distillation of the complexity of the processes it attempts to capture.
We will be using cutting-edge features in PAUP* -- so cutting edge that you will not be able to find any information about these features anywhere online or by using the help command in PAUP*! So don't get confused when you try to look up some of the components of the NEXUS file you will be using. There are some familiar blocks and commands in the NEXUS file though. Feel free to look at past labs or use the help command to refresh your memory.
Create an empty text file and add the following lines to it and save it as a .nex file:
#nexus begin paup; set storebrlens nowarntsave; end; begin taxa; dimensions ntax=4; taxlabels A B C D; end; begin trees; tree 1 = [&R] ((A:0.1,B:0.1):0.05,(C:0.1,D:0.1):0.05); end; begin dnasim; simdata nchar=10000; lset nst=1 basefreq=equal rates=equal pinvar=0; truetree source=memory treenum=1 showtruetree=brlens; beginsim nreps=100 seed=12345 monitor=no resultsfile=(name=results.txt replace output=allreps); [parsimony] set criterion=parsimony; alltrees; tally parsimony; [likelihood under JC] set criterion=likelihood; alltrees; tally 'ML-JC'; endsim; end; begin paup; quit; end;
The initial paup block tells PAUP* to store branch lengths of any tree it encounters and to not warn us if there are trees in memory when we try to quit.
- What is the reason for including storebrlens?
The taxa block contains the number of taxa and the names of the taxa.
- Why is this taxa block necessary?
The trees block contains the description of the true tree that we will use to simulate data. By default, trees are considered unrooted, but the obscure [&R] says that this tree is rooted.
The beginsim...endsim loop in the dnasim block tells PAUP* to simulate 100 nucleotide data sets using the Jukes-Cantor model with no rate heterogeneity. For each of the 100 data sets simulated, two analyses will be performed: (1) an exhaustive search using parsimony and (2) and exhaustive search using maximum likelihood. The tally commands keep track of how many times parsimony and ML infer a tree identical to the true tree used for simulation, and the tallied information is stored in the file results.txt, which is best viewed by pasting its contents into an Excel worksheet.
For both parsimony and ML, tally calculates the following quantities (where TALLYLABEL is either "parsimony" or "ML-JC"):
- TALLYLABEL_Ntrees, the number of trees tied for being best (ideally 1)
- TALLYLABEL_P, the fraction of splits in the true tree that were found in the inferred tree (averaged over number of trees inferred)
- TALLYLABEL_correct, same as TALLYLABEL_P if no incorrect splits are found in the inferred tree, otherwise 0 (averaged over number of trees inferred)
Execute the NEXUS File
Log on to the cluster, start a qlogin session, and load the current module of PAUP*. If you forget how to load modules, notice the message that was printed right after you logged on to the cluster. Start PAUP*, and execute your NEXUS file.
Note that PAUP* quits after performing the simulations (because we told it to in that final paup block). Open the results.txt file in a spreadsheet viewer to see the results.
- Did both optimality criteria get the tree correct most of the time? answer
Enter the Felsenstein Zone
As you've learned in lecture, parsimony is particularly prone to long branch attraction while maximum likelihood is able to resist joining long edges if the model is correct in the important details. Copy your NEXUS file to create a file named paupsimFZ.nex. Edit the new file and change two edge lengths to 1.0 in order to create a true tree in the Felsenstein zone.
Execute paupsimFZ.nex, then open the new results.txt file in a spreadsheet viewer.
- Did both of optimality criteria produce the same tree? answer
Change the simdata nchar=10000; line to simdata nchar=(10 100 1000 10000); and change output=allreps to output=meansonly. Now PAUP* will simulate data sets of four different sequence lengths and summarize the results rather than spitting out a line for every simulation replicate.
- Which (parsimony or ML) appears to be statistically consistent? Why? answer
Have Some Fun
-lots of time has passed
-have them make all of the branch lengths very long and see the nucleotide data
Will this Lab Ever End?
-little time has passed
-have them make all of the branch lengths teeny and see the nucleotide data
-lots of evolution has occurred for some taxa but not all
-make branch lengths very long for half of the taxa and look at the nucleotide data