assignment3

assignment3 - BSC5936-Fall 2005 Computational Evolutionary...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
BSC5936-Fall 2005 Computational Evolutionary Biology Assignment 3 – Exhaustive search (ES) and Branch and bound method (BS) Use the depth-first algorithm in the text from the handout of lecture 3 as a guide. Add the capability of doing a exhaustive search and the branch-and-bound-method to your program. this is perhaps the time to install some kind of minimal text-based user interface. Several possibilities work: Give a menu with choices: for example have a menu that allows to change between the different tree searching algorithms, Menu: T Tree search strategy: Exhaustive Change the tree search strategy [Exhaustive | Branch-and-bound | . ..]? Allow the user to input commands on a console, for example like MrBayes or Paup: for example you could specify at the prompt: set search=exhaustive or help which might result in something like this: set Syntax: set <option> Options: search Syntax: search=<method> Methods: Exhaustive Searches all possible trees and returns the best or set of best trees
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the 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.

Page1 / 2

assignment3 - BSC5936-Fall 2005 Computational Evolutionary...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online