This preview shows page 1. Sign up to view the full content.
Unformatted text preview: nodes with the new node and shift the nodes to the right of the second node to the left. The nodes are now not part of the array anymore, but are still accessible through the newly formed node. Now our array is one element shorter than we started. 5. Continue at 2 until the array has only a single element left (this is the root of the tree). 6. Once the tree is in memory, simulate data on or print etc. • Generate coalescent trees for a set of population sizes: 10000, 1000000 and 3 diﬀerent mutation rates: 10-8 ,10-6 , this will be a 2x2 table, for each cell create at least two trees (better a hundred) and then simulate data on these trees. The more sites the better the result, with the small size and low mutation rate there is a good chance that in 500 base pairs there is no variable site. • Count the number variable sites (averages). Describe the diﬀerences or similarities between your 4 cells. 1...
View Full Document
This note was uploaded on 11/27/2011 for the course BSC 5936 taught by Professor Staff during the Spring '08 term at FSU.
- Spring '08