Minimizing phylogenetic number to find good evolutionary trees
- Sandia National Labs., Albuquerque, NM (United States)
- Univ. of California, Berkeley, CA (United States). Dept. of Computer Science
- Univ. of Pennsylvania, Philadelphia, PA (United States). Dept. of Computer and Information Science
Inferring phylogenetic trees is a fundamental problem in computational-biology. We present a new objective criterion, the phylogenetic number, for evaluating evolutionary trees for species defined by biomolecular sequences or other qualitative characters. The phylogenetic number of a tree T is the maximum number of times that any given character state arises in T. By contrast, the classical parsimony criterion measures the total number of times that different character states arise in T. We consider the following related problems: finding the tree with minimum phylogenetic number, and computing the phylogenetic number of a given topology in which only the leaves are labeled by species. When the number of states is bounded (as is the case for biomolecular sequence characters), we can solve the second problem in polynomial time. We can also compute a fixed-topology 2-phylogeny (when one exists) for an arbitrary number of states. This algorithm can be used to further distinguish trees that are equal under parsimony. We also consider a number of other related problems.
- Research Organization:
- Sandia National Labs., Albuquerque, NM (United States)
- Sponsoring Organization:
- USDOE, Washington, DC (United States); National Science Foundation, Washington, DC (United States)
- DOE Contract Number:
- AC04-94AL85000
- OSTI ID:
- 70782
- Report Number(s):
- SAND--95-0831C; CONF-9507123--1; ON: DE95011893; CNN: NSF Contract CCR-9457800
- Country of Publication:
- United States
- Language:
- English
Similar Records
Numerical methods for inferring evolutionary trees
Approximation algorithms for the fixed-topology phylogenetic number problem