Evolutionary Distances

0.0(0)
studied byStudied by 1 person
0.0(0)
call with kaiCall with Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/19

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai

No study sessions yet.

20 Terms

1
New cards

Two ways that data is related to trees

  1. Distance based approaches

  2. Character based approaches

Both rely on optimality criterion

2
New cards

Distance Based Approached

  • convert sequence data into a numerical measure of evolutionary measure

  • construct a distance matrix

  • use this matrix to build a tree

3
New cards

Character Based approaches

  • use multiple sequence alignment directly

  • evaluate each site (character)

4
New cards

Evolutionary Distance

a numerical estimate of evolutionary change

increases with dissimilarity

often correlates with time since divergence

represented as branch lengths or patristic distanced

Pairwise

an estimate

5
New cards

p-distance

proportion of sites at which two sequences differ

Features:

  • normalised per site

  • based on only observed differences in extant sequences

6
New cards

Multiple Hits

  • more than one substitution can occur at the same site

  • can occur in one lineage and both lineages

  • substitutions may be superimpoed

7
New cards

Consequences of multiple Hits

  • underestimation of evolutionary distance

  • incorrect rate estimates

  • increased homoplasy

8
New cards

Homoplasy

fixation of identical by state alleles in different lineages with independent mutational origins

can mislead phylogenetic inference by grouping taxa based on similarity rather than ancestry

9
New cards

When does saturation occur

most sites have undergone one or more substitutions

additional substitutions are no longer detectable

10
New cards

Effects of saturation

  • sequences appear randomly scrambled

  • alignment becomes unreliable or impossible

  • correction for multiple hits becomes infeasible

  • phylogenetic signal is lost

11
New cards

Procedure for Distance Matrix

  1. Calculate pairwise distances between all sequences

  2. Construct a tree from the distance matrix

12
New cards

What does this mean if distances are additive?

  • each distance equals the sum of branch lengths connecting taxa

  • the matrix perfectly summarises patristic distances

13
New cards

How do we address correcting multiple hits?

  • estimate the number of unobserved substitutions

  • attempt to recover the true revolutionary distance

14
New cards

Why is correction uncertain?

  • we only observe end points

  • we lack direct knowledge of intermediate events

15
New cards

Assumptions of Jukes-Cantor Model

  • four nucleotides occur at equal frequency

  • all substitution equally likely

  • constant rate over time

  • only substitutions considered (no indels)

16
New cards

How is the JC69 model constrained?

  • each row sums to zero

  • total number of character states remains constant

17
New cards

When is JC model good?

  • when sequences are highly similar

  • few substitutions have occurred

18
New cards

5 main approaches to phylogenetic inheritance

  1. Distance methods

  2. Maximum parsimony

  3. Maximum likelihood

  4. Bayesian inference

  5. Hybrid appraoches

19
New cards

UPGMA

  • assumes a molecular clock

  • almost always inappropiate

  • explicitly discouraged

20
New cards

Neighbour Joining

  • does not assume equal rates

  • efficient and widely used

  • uses distance matrix to minimise total tree length