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 ﬁnd 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 ﬁnd 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 Asabenhur during the Fall '13 term at Colorado State.
 Fall '13
 AsaBenHur

Click to edit the document details