Inferring evolutionary history from DNA sequences

Sampath Kannan, Tandy Warnow

Research output: Contribution to journalConference article

Abstract

Two related problems are considered. The first is determining whether it is possible to triangulate a vertex-colored graph without introducing edges between vertices of the same color. This is related to a fundamental problem for geneticists, that of using character state information to construct evolutionary trees. The polynomial equivalence of these problems is demonstrated. An important subproblem arises when the characters are based on DNA sequences. Such characters assume up to four states. An O(n2k) algorithm, where n is the number of species and k is the number of characters, is presented for this case.

Original languageEnglish (US)
Pages (from-to)362-371
Number of pages10
JournalIEEE Transactions on Industry Applications
Volume27
Issue number1 pt 1
StatePublished - Jan 1 1991
Externally publishedYes
Event1989 Industry Applications Society Annual Meeting - San Diego, CA, USA
Duration: Oct 1 1989Oct 5 1989

Fingerprint

DNA sequences
Polynomials
Color

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Industrial and Manufacturing Engineering
  • Electrical and Electronic Engineering

Cite this

Inferring evolutionary history from DNA sequences. / Kannan, Sampath; Warnow, Tandy.

In: IEEE Transactions on Industry Applications, Vol. 27, No. 1 pt 1, 01.01.1991, p. 362-371.

Research output: Contribution to journalConference article

@article{e2e13089f00f4caa9ace78e6db1994c3,
title = "Inferring evolutionary history from DNA sequences",
abstract = "Two related problems are considered. The first is determining whether it is possible to triangulate a vertex-colored graph without introducing edges between vertices of the same color. This is related to a fundamental problem for geneticists, that of using character state information to construct evolutionary trees. The polynomial equivalence of these problems is demonstrated. An important subproblem arises when the characters are based on DNA sequences. Such characters assume up to four states. An O(n2k) algorithm, where n is the number of species and k is the number of characters, is presented for this case.",
author = "Sampath Kannan and Tandy Warnow",
year = "1991",
month = "1",
day = "1",
language = "English (US)",
volume = "27",
pages = "362--371",
journal = "IEEE Transactions on Industry Applications",
issn = "0093-9994",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1 pt 1",

}

TY - JOUR

T1 - Inferring evolutionary history from DNA sequences

AU - Kannan, Sampath

AU - Warnow, Tandy

PY - 1991/1/1

Y1 - 1991/1/1

N2 - Two related problems are considered. The first is determining whether it is possible to triangulate a vertex-colored graph without introducing edges between vertices of the same color. This is related to a fundamental problem for geneticists, that of using character state information to construct evolutionary trees. The polynomial equivalence of these problems is demonstrated. An important subproblem arises when the characters are based on DNA sequences. Such characters assume up to four states. An O(n2k) algorithm, where n is the number of species and k is the number of characters, is presented for this case.

AB - Two related problems are considered. The first is determining whether it is possible to triangulate a vertex-colored graph without introducing edges between vertices of the same color. This is related to a fundamental problem for geneticists, that of using character state information to construct evolutionary trees. The polynomial equivalence of these problems is demonstrated. An important subproblem arises when the characters are based on DNA sequences. Such characters assume up to four states. An O(n2k) algorithm, where n is the number of species and k is the number of characters, is presented for this case.

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

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

M3 - Conference article

AN - SCOPUS:0025742006

VL - 27

SP - 362

EP - 371

JO - IEEE Transactions on Industry Applications

JF - IEEE Transactions on Industry Applications

SN - 0093-9994

IS - 1 pt 1

ER -