Lecture_7_phylogenetics

# Compress i and j into k iterate algorithm for rest of

This preview shows page 1. Sign up to view the full content.

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: e dij(T) - the length of a path between leaves i and j dij(T) – tree distance between i and j Distance in Trees: An Exampe j i Distance Matrix •  Given n species, we can compute the n x n distance matrix Dij •  Dij may be deﬁned as the edit distance between a gene in species i and species j, where the gene of interest is sequenced for all n species. Dij – edit distance between i and j d1,4 = 12 + 13 + 14 + 17 + 12 = 68 Edit Distance vs. Tree Distance •  Given n species, we can compute the n x n distance matrix Dij •  Dij may be deﬁned as the edit distance between a gene in species i and species j, where the gene of interest is sequenced for all n species. Dij – edit distance between i and j •  Note the diﬀerence with Firng Distance Matrix •  Given n species, we can compute the n x n distance matrix Dij •  Evolu?on of these genes is described by a tree that we don’t know. •  We need an algorithm to construct a tree that best ﬁts the distance matrix Dij dij(T) – tree distance between i and j 6 9/16/13 Firng Distance Matrix Lengths of path in an (unknown) tree T •  Firng means Dij = dij(T) Edit distance between species (known) Reconstruc?...
View Full Document

## This note was uploaded on 02/10/2014 for the course CS 425 taught by Professor Asaben-hur during the Fall '13 term at Colorado State.

Ask a homework question - tutors are online