This preview shows page 1. Sign up to view the full content.
Unformatted text preview: possible positions, calculating the score for each tree. Then you save the three best trees and continue with the next starting tree. Again you add the next tip in all possible positions and replace the worst of the three trees in memory every time you nd a tree with a better score. At the end of the search, go through all trees in memory and delete the ones that are longer than the best tree(s). 3. (Optional) Program a branch swapping algorithm of your choice to improve the best tree resulting from your stepwise addition algorithm. We recommend that you program either NNI or the TBR algorithm with a neighborhood variable that determines how far away from the original position (in number of nodes) that you will move the attachment point of either subtree on the other subtree....
View Full Document
This note was uploaded on 11/27/2011 for the course BSC 5936 taught by Professor Staff during the Spring '08 term at FSU.
- Spring '08