View Proposal #75
If this proposal belongs to you, you are authorized to update it. Use the menu on the right.
ID | 75 |
---|---|
First Name | Stephen |
Last Name | Willson |
Institution | Iowa State University |
Speaker Category | faculty |
Title of Talk | Building supertrees using distances |
Abstract | Suppose that a family of rooted phylogenetic trees Ti with different sets Xi of leaves is given. A supertree for the family would be a single rooted tree T whose leaf set is the union of all the Xi, such that the branching information in T corresponds to the branching information in all the trees Ti. This talk proposes a polynomial-time method BUILD-WITH-DISTANCES that makes essential use of distance information provided on the trees Ti to construct a rooted tree T. When a supertree containing also the distance information exists, then the method produces a supertree T. This supertree often shows increased resolution over the trees found by methods that utilize only the topology of the input trees. |
Subject area(s) | graph theory |
Suitable for undergraduates? | Yes |
Day Preference | |
Computer Needed? | Y |
Bringing a laptop? | Y |
Overhead Needed? | |
Software requests | |
Special Needs | |
Date Submitted | 3/31/2004 |
Year | 2004 |