@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",

}