Lecture_7_phylogenetics

E pam and blossum a a r n d r n d c q e g h i

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

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: and column corresponding to k, where the distance from k to any other leaf m can be computed as: Dkm = (Dim + Djm – Dij)/2 •  To find neighboring leaves we simply select a pair of closest leaves. Compress i and j into k, iterate algorithm for rest of tree Finding Neighboring Leaves •  To find neighboring leaves we simply select a pair of closest leaves. Finding Neighboring Leaves •  Closest leaves aren’t necessarily neighbors •  i and j are neighbors, but (dij = 13) > (djk = 12) WRONG!!!! •  Finding a pair of neighboring leaves is a nontrivial problem! Degenerate Triples •  A degenerate triple is a set of three dis?nct element...
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