Phylogenetic Trees Tutorial 5

Agenda How to construct a tree using Neighbor Joining algorithm Phylogeny.fr tool Cool story of the day: Horizontal gene transfer

3 Neighbor Joining Algorithm Constructs an unrooted guide tree from a distance matrix We do not assume constant rate of evolution

1.Calculate all pairwise distances. 2.Find 2 nodes i and j, such that the relative distance between i and j is minimal. 3.Remove the rows and columns of i and j 4.Add a new row and column k (the parent of i and j), and compute the distance from k to any other remaining node. 5.Continue until two nodes remain – connect them with an edge. Neighbor Joining Algorithm 2 matrices

EDCBA A B C D E Step 1. Calculate all pairwise distances A, B, …, E are tree nodes. Each character represents a sequence. How can we measure distance between sequences?

Euclidean Distance: Given a multiple sequence alignment, calculate the square root of the sum of the score at every position between two sequences The score increases as the dissimilarity between residues increases. Step 1. Calculate all pairwise distances distance between sequences

If we assume constant evolution rate we may construct a wrong tree. Closest leaves aren’t necessarily neighbors: i and j are neighbors, but (d ij = 13) > (d jk = 12) Step 2. Two nodes with minimal relative distance

Find a pair of leaves that are close to each other, but far from other leaves. This is called “relative distance”.

Relative distance between i and j Distance between i and j (from the distance table) Distance between i and all other nodes Number of leaves (=sequences) left in the tree Step 2. Two nodes with minimal relative distance

EDCBA A B C D E Distances matrix: A B C D E

EDCBA A B C D -----E A,B is the pair with the minimal M i,j distance. The Mij Table is used only to choose the closest pairs (lowest value) and not for calculating the distances Step 2. Two nodes with minimal relative distance The relative distance table:

Steps 3+4. Remove i, j and add k to the matrix D km = (D im + D jm – D ij )/2 Compress i and j into k, iterate algorithm for rest of tree the distance from k to any other leaf m can be computed as:

EDCk k C D E Now we’ll calculate the distance from X to all other nodes: Steps 3+4. Remove i, j and add k to the matrix A B C D E K

The final tree: Steps 5. Continue till 2 nodes remain A B C D E K Y What is missing? Z

Phylogeny.fr

One click mode

Multiple sequence alignment (MSA) is a basic step in phylogenetic tree construction and is the base for the distance matrix

“A la carte” mode

“On-click” default settings

Cool Story of the day Horizontal gene transfer

Is horizontal gene transfer possible?

Viruses

Horizontal gene transfer is the primary reason for bacterial antibiotic resistance and plays an important role in the evolution of bacteria. Horizontal gene transfer in Bacteria Horizontal gene transfer is very abundant in bacteria, it is hard to talk about a bacteria’s genome, but more of the genome of a “society of bacteria”.

Sea slug The sea slug Elysia chlorotica incorporates chloroplasts from the algae that it eats into its body. Photosynthesis continues for up to 12 months using genes within the chloroplast, which are directed by algal nuclear genes that were transferred to the nuclei of the slug.Elysia chloroticachloroplastsalgaePhotosynthesis

Bioinformatics/ David W.Mount p. 244 Until the full speciation…