Biol375 2019

From QiuLab
Revision as of 18:12, 6 September 2019 by imported>Weigang (→‎Part 1. Tree Thinking)
Jump to navigation Jump to search
Molecular Evolution (BIOL 375.00/790.64/793.03, Fall 2019)
Instructor: Dr Weigang Qiu, Professor, Department of Biological Sciences
Room: 926 HN (Seminar Room, North Building)
Hours: Mon. & Thur 4:10-5:25 pm
Office Hours: Belfer Research Building (Google Map) BB-402; Fridays 3-5pm or by appointment
Course Website: http://diverge.hunter.cuny.edu/labwiki/Biol375_2019
christopher.panlasigui47@myhunter.cuny.edu
Borreliabase-screenshot-1.png

Course Description

Molecular evolution is the study of the change of DNA and protein sequences through time. Theories and techniques of molecular evolution are widely used in species classification, biodiversity, comparative genomics, and molecular epidemiology. Contents of the course include:

  • Population genetics, which is a theoretical framework for understanding mechanisms of sequence evolution through mutation, recombination, gene duplication, genetic drift, and natural selection.
  • Molecular systematics, which introduces statistical models of sequence evolution and methods for reconstructing species phylogeny.
  • Bioinformatics, which provides hands-on training on data acquisition and the use of software tools for phylogenetic analyses.

This 3-credit course is designed for upper-level biology-major undergraduates. Hunter pre-requisites are BIOL203, and MATH150 or STAT113.

Textbooks

  • (Required) Graur, 2016, Molecular and Genome Evolution, First Edition, Sinauer Associates, Inc. ISBN: 978-1-60535-469-9. Publisher's Website (Student discount: a 15% discount and receive free UPS standard shipping)

http://www.sinauer.com/molecular-and-genome-evolution.html)

  • (Recommended) Baum & Smith, 2013. Tree Thinking: an Introduction to Phylogenetic Biology, Roberts & Company Publishers, Inc.

Learning Goals

  • Be able to describe evolutionary relationships using phylogenetic trees
  • Be able to use web-based as well as stand-alone software to infer phylogenetic trees
  • Understand mechanisms of DNA sequence evolution
  • Understand algorithms for building phylogenetic trees

Links for phylogenetic tools

Exams & Grading

  • Bonus for full attendance & active participation in classroom discussions.
  • Assignments. All assignments should be handed in as hard copies only. Email submission will not be accepted. Late submissions will receive 10% deduction (of the total grade) per day.
  • Three Mid-term Exams (30 pts each)
  • Comprehensive Final Exam (50 pts)

Academic Honesty

While students may work in groups and help each other for assignments, duplicated answers in assignments will be flagged and investigated as possible acts of academic dishonesty. To avoid being investigated as such, do NOT copy anyone else's work, or let others copy your work. At the least, rephrase using your own words. Note that the same rule applies regarding the use of textbook and online resources: copied sentences are not acceptable and will be considered plagiarism.

Hunter College regards acts of academic dishonesty (e.g., plagiarism, cheating on examinations, obtaining unfair advantage, and falsification of records and official documents) as serious offenses against the values of intellectual honesty. The College is committed to enforcing the CUNY Policy on Academic Integrity and will pursue cases of academic dishonesty according to the Hunter College Academic Integrity Procedures.

Course Schedule

Part 1. Tree Thinking

  • 8/29 (TH). Overview & Introduction. Textbook Chapter: "Introduction" (pages 1-3)
Assignment 1 (10 pts; Due next class 9/5)
  • (10 pts) Pre-test: Full credits will be given as long as each question is answered with some reasoning. In other words, it will NOT be graded on being right or wrong. It's an assessment tool, to be compared with later test outcomes to show teaching/learning results.
    File:Pretest.pdf
  • 9/5 (TH). Introduction (Continued).
    • R terminologies
      • Object: variable that contains data (e.g., "iris")
      • Object class: type of data (e.g., "data.frame", which is a table)
      • Function: e.g., data(iris), which loads the data set called "iris"
      • Function arguments: input and options (e.g., "iris" above)
    • Tutorial: R & R-Studio (Bring your own computer)
    • Lecture slides:
      File:Intro-2019.pdf
Assignment 2 (5 pts; Due: next session)
R exercises
  1. Install R & R-studio (see "Links for phylogenetic tools" above)
  2. Open R-studio and install the "ape" package using the "Packages"->"Install" menu, located within the lower right window
  3. Type in the console window (lower left) the following commands (one at a time, wait for the prompt ">" to appear before proceed to the next command; quit & restart R-studio if stuck):
    1. library(ape)
    2. tr <- read.tree(text = "(monkey:0.09672,((tarsier:0.18996,lemur:0.14790)0.999:0.09005,(macaque:0.18524,(gibbon:0.10388,(orang-utan:0.09481,(human:0.03391,(gorilla:0.06135,chimpanzee:0.05141):0.01580)0.316:0.05381)1.000:0.03019)0.978:0.05616)0.997:0.05042)0.965:0.09672);")
    3. plot(tr)
  4. Export the tree graph using the "Export"->"Save as PDF" or "Save as Image" menu in the lower right window
  5. Exit R studio by typing the command "q()" and type "y" to answer the question for saving the R session
  6. Copy & paste the tree image into your document to be handed in
  • 9/9 (M). Intro to trees.
  • 9/12 (TH). Intro to trees (continued)
    • In-class exercise 2. (5 pts)
    • Textbook Chapter 5: "Molecular Phylogenetics" (pages 170-175; 201-202)
  • 9/16 (M). Species Tree & Lineage Sorting.
    • Textbook Chapter 5: "Molecular Phylogenetics" (pages 177-180).
  • 9/19 (TH). Consensus Tree & Review.
    • Chapter 5. pages 199-200 (Figure 5.31)
    • In-class exercise 3. (5 pts, due next session)
    • Lecture Slides.
  • 9/23 (M). 4:10 - 5:10pm Midterm Exam I Bring pencils, erasers, and a calculator

Part 2. analysis of Trait Evolution

  • 9/26 (TH). Traits & trait matrix
    • Textbook Chapter 5, pages 180-183
Assignment #3 (5 pts; Due next session)
Watch Origin of Species: Lizards in an Evolutionary Tree. Provide short answer (1-3 sentences) to each of the following three questions.
  1. What are the two hypotheses explaining the origin of different ecomorphs of lizards on Caribbean Islands?
  2. What is the expected phylogeny under each hypothesis?
  3. Which hypothesis is supported by the phylogeny of actual DNA sequences?
  • 9/27 (TH). Homoplasy & consistency
Assignment #4 (5 pts; Due next session)
  1. Download or Copy/Paste the lizard DNA sequences to your own computer and save the file as "lizard.txt"
  2. Align the DNA sequences using this website and save the aligned DNA file ("Output->Alignment in Fasta format") as "lizard-aligned.txt". Use "one-click" option to make a tree.
  3. Based on the lizard card, construct a character-state matrix for all lizard species. For each species, list its character state for each of the following two characters (as columns): (1) Geographic origin, and (2) Habitat.
  4. Determine which hypothesis ("Multiple origin" or "Single origin" of ecomorphs) is more supported by the mtDNA tree. Explain.

Part 3. Tree Algorithms

  • 10/22 (M). BLAST & Alignments (Chapter 3. pages 93-100). In-class exercise: Run BLAST; show alignment & explain E-value
  • 10/25 (TH). Genetic distances & Sequence-evolutionary models (Chapter 3, pages 79-88). In-class exercise: Poisson simulation & explain

* 10/29 (Mon). No class (instructor traveling)

  • 11/1 (TH). Maximum parsimony (Chapter 5, pages 191-194). In-class exercise: parsimony scores
  • 11/5 (M). Distance methods (Chapter 5, pages 184-187). In class exercise: use APE package to calculate genetic distances
  • 11/8 (TH). Likelihood & Bayesian methods; Tree Testing (Chapter 5, pages 194-198).
  • 11/12 (M). Review (Chapter 5, pages 207-209). Review exercises. Lecture slides:
    File:Part-3-tree-construction-small-2018.pdf
  • 11/15 (TH). Midterm Exam 3

Part 4. Mechanisms of molecular evolution

  • 11/19 (M). Mechanism of molecular evolution: Overview (pages 35-38) & Rates of nucleotide substitutions (pages 111-125).
  • 11/26 (M). Ka/Ks test of natural selection (pg 116-124). In-class exercise
  • 11/29 (TH). In-class computer exercise:
Final project (20 pts). Due: 12/6, Thursday)
  1. Calculate genetic distances
    1. Download or Copy/Paste the lizard DNA sequences to your own computer and save the file as "anoles.txt"
    2. Align the DNA sequences using this website and save the aligned DNA file ("Output->Alignment in Fasta format") as "anoles-aligned.txt" (No need to print or submit the above two DNA sequence files; save them in a folder)
    3. Load library: library(ape)
    4. Read alignment: mt = read.FASTA("anoles-aligned.txt")
    5. Calculate raw distance: mt.raw = dist.dna(mt, model = "raw")
    6. Apply Juke-Cantor (one-parameter model) correction: mt.jc = dist.dna(mt, model = "JC")
    7. Apply Kimura(two-parameter model, for Ts and Tv) correction: mt.k80 = dist.dna(mt, model = "K80")
    8. Plot JC distance vs the raw distance: plot(mt.raw, mt.jc, xlab = "uncorrected distance (diff/site)", ylab = "corrected distance (sub/site)", xlim = c(0,0.4), ylim = c(0,0.5), las =1)
    9. Add a 1:1 line: abline(0,1, col = "red")
    10. Add K80 distances: points(mt.raw, mt.k80, pch = 3, col = "blue")
    11. Add a legend: legend(0.05, 0.45, legend = c("JC (1-parameter)", "K80 (2-parameter)"), pch = c(1,3), col = c("black","blue"), bty = "n")
    12. Export an PDF and print a copy
    13. Use the graph to explain (1) Why it is necessary to correct for raw distances when comparing sequences from distantly related species; (2) What is the key difference between the K80 and JC models
  2. Comparison of distance and parsimony trees (review previous assignments for detailed R-Studio instructions)
    1. In R studio, install & load the "ape" and "phangnorm" libraries
      1. Obtain a neighbor-joining tree using K80 model: tree.nj = NJ(mt.k80)
      2. Plot a midpoint rooted tree: plot(midpoint(tree.nj))
      3. Add a scale bar: add.scale.bar()
      4. Print tree and answer this question: what does the distance represent? What is the unit?
    2. Obtain a maximum parsimony tree
      1. Convert object to a different class: aln.phy = as.phyDat(mt)
      2. Search maximum parsimony tree.mp = optim.parsimony(tree.nj, aln.phy)
      3. Get tree distance: tree.mp = acctran(tree.mp, aln.phy)
      4. Plot tree: plot(midpoint(tree.mp))
      5. Add a scale bar: add.scale.bar()
      6. Print tree and answer the question: what does the distance represent? What is the unit?
    3. Compare the two trees and explain the differences in these two methods: Which one uses full sequence information and why?
  3. Bootstrap analysis
    1. aln.fas <- read.dna("anoles-aligned.txt", format ="fasta")
    2. Create a function for re-rooted distance tree: tree.fun = function(x) root(nj(dist.dna(x)), outgroup = c("Leiocephalus_barahonensis"), resolve.root = T)
    3. Calculate a tree: tr = tree.fun(aln.fas)
    4. Perform bootstrap for 100 pseudo-replicates: boot.trees = boot.phylo(tr, aln.fas, tree.fun, B=100, rooted =T)
    5. Plot tree: plot(tr, no.margin = T)
    6. Add bootstrap values as node labels: nodelabels(boot.trees, bg= "white")
    7. Explain (1) Does bootstrap test for tree precision or tree accuracy? (2) What does a bootstrap value of 80% mean?
Retrieved from "https://wiki.genometracker.org/index.php?title=Biol375_2019&oldid=5335"