Inferring evolutionary trees from ordinal data
- Univ. of Toronto, Ontario (Canada)
- Univ. of Lethbridge (Canada)
- Queen`s Univ., Kingston, Ontario (Canada)
In this paper we present four results on the inference of evolutionary trees from ordinal information. An evolutionary tree T, or phylogeny, is an ordinal representation of a distance matrix , for all species a, b, c and d under consideration. In particular, we show that (1) Ordinal representations of distance matrices can be found in O(n{sup 2}log{sup 2} n) time where n is the number of species. Ordinal representations are shown to be unique, when they exist. (3) Determining if there is an ordinal representation for an incomplete distance matrix, a situation which arises in evolutionary studies, is NP-complete. (3) Finding a phylogeny that best fits a distance matrix containing ordinal errors is NP-complete. (4) Under reasonable conditions, a weighted ordinal representation of a distance matrix can be obtained in polynomial time.
- OSTI ID:
- 471698
- Report Number(s):
- CONF-970142-; TRN: 97:001377-0047
- Resource Relation:
- Conference: 8. annual Association for Computing Machinery (ACM)-Society for Industrial and Applied Mathematics (SIAM) symposium on discrete algorithms, New Orleans, LA (United States), 5-7 Jan 1997; Other Information: PBD: 1997; Related Information: Is Part Of Proceedings of the eighth annual ACM-SIAM symposium on discrete algorithms; PB: 798 p.
- Country of Publication:
- United States
- Language:
- English
Similar Records
A robust model for finding optimal evolutionary trees
Numerical methods for inferring evolutionary trees