New Zealand Journal of Botany abstracts

---

Constructing phylogenetic trees efficiently using compatibility criteria

TANDY J. WARNOW

Sandia National Laboratories
P.O. Box 5800
Albuquerque, NM 87185, U.S.A.*
*Present address: Department of Computer and
Information Sciences, University of Pennsylvania,
200 S 33rd Street, Moore 276, Philadelphia, PA
19104, U.S.A.

Abstract The Character Compatibility Problem is a classical problem in computational biology concerned with constructing phylogenetic trees of minimum possible evolution from qualitative character sets. This problem arose in the 1970s, and until recently the only cases for which efficient algorithms were found were for binary (i.e. two- state) characters and for two characters at a time, while the complexity of the general problem remained open. In this paper we will discuss the remarkable progress on this problem since 1990.

Keywords evolution; algorithms; phylogenetic tree;

B93007 ; Received 19 January 1993; accepted 8 June 1993
New Zealand Journal of Botany, 1993, Vol. 31: 239-248
0028-825X/93/3103-0239 $2.50/0 © The Royal Society of New Zealand 1993

PDF file of entire paper: medium quality (787K); (scanned from paper original: notes about this process)

---

This year's abstracts | Journal home page | All abstracts | Publishing home page