### Abstract

The input to a supertree problem is a collection of phylogenetic trees that intersect pairwise in their leaf sets; the goal is to construct a single tree that retains as much as possible of the information in the input. This task is complicated by inconsistencies due to errors. We consider the case where the source trees are rooted and are represented by the clusters they exhibit. The problem is to find the minimum number of flips needed to resolve all inconsistencies, where each flip moves a taxon into or out of a cluster. We prove that the minimum flip problem is NP-complete, but show that it is fixed-parameter tractable and give an approximation algorithm for a special case.

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

Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |

Publisher | Springer Verlag |

Pages | 391-400 |

Number of pages | 10 |

Volume | 2387 |

ISBN (Print) | 354043996X, 9783540439967 |

State | Published - 2002 |

Externally published | Yes |

Event | 8th Annual International Conference on Computing and Combinatorics, COCOON 2002 - Singapore, Singapore Duration: Aug 15 2002 → Aug 17 2002 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 2387 |

ISSN (Print) | 03029743 |

ISSN (Electronic) | 16113349 |

### Other

Other | 8th Annual International Conference on Computing and Combinatorics, COCOON 2002 |
---|---|

Country | Singapore |

City | Singapore |

Period | 8/15/02 → 8/17/02 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Science(all)
- Theoretical Computer Science

### Cite this

*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)*(Vol. 2387, pp. 391-400). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2387). Springer Verlag.

**Supertrees by flipping.** / Chen, D.; Eulenstein, O.; Fernández-Baca, David; Sanderson, Michael.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).*vol. 2387, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2387, Springer Verlag, pp. 391-400, 8th Annual International Conference on Computing and Combinatorics, COCOON 2002, Singapore, Singapore, 8/15/02.

}

TY - GEN

T1 - Supertrees by flipping

AU - Chen, D.

AU - Eulenstein, O.

AU - Fernández-Baca, David

AU - Sanderson, Michael

PY - 2002

Y1 - 2002

N2 - The input to a supertree problem is a collection of phylogenetic trees that intersect pairwise in their leaf sets; the goal is to construct a single tree that retains as much as possible of the information in the input. This task is complicated by inconsistencies due to errors. We consider the case where the source trees are rooted and are represented by the clusters they exhibit. The problem is to find the minimum number of flips needed to resolve all inconsistencies, where each flip moves a taxon into or out of a cluster. We prove that the minimum flip problem is NP-complete, but show that it is fixed-parameter tractable and give an approximation algorithm for a special case.

AB - The input to a supertree problem is a collection of phylogenetic trees that intersect pairwise in their leaf sets; the goal is to construct a single tree that retains as much as possible of the information in the input. This task is complicated by inconsistencies due to errors. We consider the case where the source trees are rooted and are represented by the clusters they exhibit. The problem is to find the minimum number of flips needed to resolve all inconsistencies, where each flip moves a taxon into or out of a cluster. We prove that the minimum flip problem is NP-complete, but show that it is fixed-parameter tractable and give an approximation algorithm for a special case.

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

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

M3 - Conference contribution

SN - 354043996X

SN - 9783540439967

VL - 2387

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 391

EP - 400

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -