Supertrees by flipping

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

doi:10.1007/3-540-45655-4_42

Supertrees by flipping

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

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

6 Scopus citations

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	Computing and Combinatorics - 8th Annual International Conference, COCOON 2002, Proceedings
Editors	Oscar H. Ibarra, Louxin Zhang
Publisher	Springer-Verlag
Pages	391-400
Number of pages	10
ISBN (Print)	354043996X, 9783540439967
DOIs	https://doi.org/10.1007/3-540-45655-4_42
State	Published - Jan 1 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)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	8th Annual International Conference on Computing and Combinatorics, COCOON 2002
Country	Singapore
City	Singapore
Period	8/15/02 → 8/17/02

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/3-540-45655-4_42

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

Cite this

Chen, D., Eulenstein, O., Fernández-Baca, D., & Sanderson, M. (2002). Supertrees by flipping. In O. H. Ibarra, & L. Zhang (Eds.), Computing and Combinatorics - 8th Annual International Conference, COCOON 2002, Proceedings (pp. 391-400). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2387). Springer-Verlag. https://doi.org/10.1007/3-540-45655-4_42

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

Computing and Combinatorics - 8th Annual International Conference, COCOON 2002, Proceedings. ed. / Oscar H. Ibarra; Louxin Zhang. 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 proceeding › Conference contribution

Chen, D, Eulenstein, O, Fernández-Baca, D & Sanderson, M 2002, Supertrees by flipping. in OH Ibarra & L Zhang (eds), Computing and Combinatorics - 8th Annual International Conference, COCOON 2002, Proceedings. 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. https://doi.org/10.1007/3-540-45655-4_42

Chen D, Eulenstein O, Fernández-Baca D, Sanderson M. Supertrees by flipping. In Ibarra OH, Zhang L, editors, Computing and Combinatorics - 8th Annual International Conference, COCOON 2002, Proceedings. Springer-Verlag. 2002. p. 391-400. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-45655-4_42

Chen, D. ; Eulenstein, O. ; Fernández-Baca, David ; Sanderson, M. / Supertrees by flipping. Computing and Combinatorics - 8th Annual International Conference, COCOON 2002, Proceedings. editor / Oscar H. Ibarra ; Louxin Zhang. 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 M. Sanderson",

year = "2002",

month = jan,

day = "1",

doi = "10.1007/3-540-45655-4_42",

language = "English (US)",

isbn = "354043996X",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer-Verlag",

pages = "391--400",

editor = "Ibarra, {Oscar H.} and Louxin Zhang",

booktitle = "Computing and Combinatorics - 8th Annual International Conference, COCOON 2002, Proceedings",

note = "8th Annual International Conference on Computing and Combinatorics, COCOON 2002 ; Conference date: 15-08-2002 Through 17-08-2002",

}

TY - GEN

T1 - Supertrees by flipping

AU - Chen, D.

AU - Eulenstein, O.

AU - Fernández-Baca, David

AU - Sanderson, M.

PY - 2002/1/1

Y1 - 2002/1/1

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

U2 - 10.1007/3-540-45655-4_42

DO - 10.1007/3-540-45655-4_42

M3 - Conference contribution

AN - SCOPUS:84949802237

SN - 354043996X

SN - 9783540439967

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

SP - 391

EP - 400

BT - Computing and Combinatorics - 8th Annual International Conference, COCOON 2002, Proceedings

A2 - Ibarra, Oscar H.

A2 - Zhang, Louxin

PB - Springer-Verlag

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

Y2 - 15 August 2002 through 17 August 2002

ER -