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 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 1991 |
| Externally published | Yes |
| Event | 1989 Industry Applications Society Annual Meeting - San Diego, CA, USA Duration: Oct 1 1989 → Oct 5 1989 |
ASJC Scopus subject areas
- Control and Systems Engineering
- Industrial and Manufacturing Engineering
- Electrical and Electronic Engineering