This preview shows page 1. Sign up to view the full content.
Unformatted text preview: information from the root, back up to the leaves. • For this example, we are dealing with one column of the sequence alignment. In this simple example, we compute one possible set of internal states (but we learned that this doesn't cover all possible states - see lecture 7 for details): def upPass(tree,parent): if tree is a leaf: #(stop) return i = parent <intersect> downpass if i = None: data = i <union> downpass upPass(left,data) upPass(right,data)...
View Full Document
This note was uploaded on 11/11/2011 for the course BIO 20.010j taught by Professor Lindagriffith during the Spring '06 term at MIT.
- Spring '06