Supertrees by flipping

D. Chen, O. Eulenstein, David Fernández-Baca, M. Sanderson

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Scopus citations


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 languageEnglish (US)
Title of host publicationComputing and Combinatorics - 8th Annual International Conference, COCOON 2002, Proceedings
EditorsOscar H. Ibarra, Louxin Zhang
Number of pages10
ISBN (Print)354043996X, 9783540439967
StatePublished - 2002
Event8th Annual International Conference on Computing and Combinatorics, COCOON 2002 - Singapore, Singapore
Duration: Aug 15 2002Aug 17 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other8th Annual International Conference on Computing and Combinatorics, COCOON 2002

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Supertrees by flipping'. Together they form a unique fingerprint.

Cite this