Constructing phylogenetic trees efficiently using compatibility criteria

Research output: Contribution to journalArticle

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.

Original languageEnglish (US)
Pages (from-to)239-248
Number of pages10
JournalNew Zealand Journal of Botany
Volume31
Issue number3
DOIs
StatePublished - Jul 1 1993
Externally publishedYes

Fingerprint

bioinformatics
phylogenetics
phylogeny

Keywords

  • Algorithms
  • Evolution
  • Phylogenetic tree

ASJC Scopus subject areas

  • Ecology, Evolution, Behavior and Systematics
  • Plant Science

Cite this

Constructing phylogenetic trees efficiently using compatibility criteria. / Warnow, Tandy.

In: New Zealand Journal of Botany, Vol. 31, No. 3, 01.07.1993, p. 239-248.

Research output: Contribution to journalArticle

@article{2e9ebb3e0cbf45d5bb4de530943844f7,
title = "Constructing phylogenetic trees efficiently using compatibility criteria",
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 = "Algorithms, Evolution, Phylogenetic tree",
author = "Tandy Warnow",
year = "1993",
month = "7",
day = "1",
doi = "10.1080/0028825X.1993.10419501",
language = "English (US)",
volume = "31",
pages = "239--248",
journal = "New Zealand Journal of Botany",
issn = "0028-825X",
publisher = "Taylor and Francis Ltd.",
number = "3",

}

TY - JOUR

T1 - Constructing phylogenetic trees efficiently using compatibility criteria

AU - Warnow, Tandy

PY - 1993/7/1

Y1 - 1993/7/1

N2 - 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.

AB - 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.

KW - Algorithms

KW - Evolution

KW - Phylogenetic tree

UR - http://www.scopus.com/inward/record.url?scp=25444526825&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=25444526825&partnerID=8YFLogxK

U2 - 10.1080/0028825X.1993.10419501

DO - 10.1080/0028825X.1993.10419501

M3 - Article

AN - SCOPUS:25444526825

VL - 31

SP - 239

EP - 248

JO - New Zealand Journal of Botany

JF - New Zealand Journal of Botany

SN - 0028-825X

IS - 3

ER -