### 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(n^{2}k) algorithm, where n is the number of species and k is the number of characters, is presented for this case.

Original language | English (US) |
---|---|

Pages (from-to) | 362-371 |

Number of pages | 10 |

Journal | IEEE Transactions on Industry Applications |

Volume | 27 |

Issue number | 1 pt 1 |

State | Published - Jan 1 1991 |

Externally published | Yes |

Event | 1989 Industry Applications Society Annual Meeting - San Diego, CA, USA Duration: Oct 1 1989 → Oct 5 1989 |

### Fingerprint

### ASJC Scopus subject areas

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

### Cite this

*IEEE Transactions on Industry Applications*,

*27*(1 pt 1), 362-371.

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

Research output: Contribution to journal › Conference article

*IEEE Transactions on Industry Applications*, vol. 27, no. 1 pt 1, pp. 362-371.

}

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 -