Supertrees by flipping

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

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

6 Citations (Scopus)

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 languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages391-400
Number of pages10
Volume2387
ISBN (Print)354043996X, 9783540439967
StatePublished - 2002
Externally publishedYes
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)
Volume2387
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other8th Annual International Conference on Computing and Combinatorics, COCOON 2002
CountrySingapore
CitySingapore
Period8/15/028/17/02

Fingerprint

Approximation algorithms
Flip
Computational complexity
Inconsistency
Phylogenetic Tree
Intersect
Approximation Algorithms
Pairwise
Resolve
Leaves
NP-complete problem

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Chen, D., Eulenstein, O., Fernández-Baca, D., & Sanderson, M. (2002). Supertrees by flipping. In 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.

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

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

Chen, D, Eulenstein, O, Fernández-Baca, D & Sanderson, M 2002, Supertrees by flipping. in 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.
Chen D, Eulenstein O, Fernández-Baca D, Sanderson M. Supertrees by flipping. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2387. Springer Verlag. 2002. p. 391-400. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Chen, D. ; Eulenstein, O. ; Fernández-Baca, David ; Sanderson, Michael. / Supertrees by flipping. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2387 Springer Verlag, 2002. pp. 391-400 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{6a29d614626c4e88b7dddbde0ab68966,
title = "Supertrees by flipping",
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.",
author = "D. Chen and O. Eulenstein and David Fern{\'a}ndez-Baca and Michael Sanderson",
year = "2002",
language = "English (US)",
isbn = "354043996X",
volume = "2387",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "391--400",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

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 -