4003-532/4005-736 Parallel Computing II
Module 3 Lecture Notes -- Phylogenetic Trees
Exhaustive Search
Prof. Alan Kaminsky
Rochester Institute of Technology -- Department of Computer Science
Exhaustive Search Program
- Approach
- Input S DNA sequences
- Excise uninformative sites
- Generate all (2S - 3)!! phylogenetic trees
- Compute parsimony score (number of state changes) of each tree using the Fitch algorithm
- Output tree(s) with the best (smallest) score
- Tree generation algorithm
- Depth-first search of the space of phylogenetic trees
- Package edu.rit.phyl.pars
Example 1
Example 2
|
Parallel Computing II
|
|
•
|
|
4003-532-70/4005-736-70
|
|
•
|
|
Spring Quarter 2007
|
|
Course Page
|
|
Alan Kaminsky
|
|
•
|
|
Department of Computer Science
|
|
•
|
|
Rochester Institute of Technology
|
|
•
|
|
4486 +
2220 =
6706
|
|
Home Page
|
Copyright © 2007 Alan Kaminsky.
All rights reserved.
Last updated 13-May-2007.
Please send comments to ark@cs.rit.edu.
|