logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Minimum-flip supertrees:: Complexity and algorithms

delete2006-04-01
delete29
PRE
AI
D
Duhong Chen
O
Oliver Eulenstein
D
David Fernández‐Baca
M
Michael J. Sanderson
DOI：10.1109/TCBB.2006.26delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
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 input 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 approximation algorithms for special cases.
Keywords:
phylogenetic tree
supertree
tree assembly
NP-completeness
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

I
IEEE-ACM Transactions on Computational Biology and Bioinformatics
IF:
3.4
Papers:
3.3K
Citations:
6.4K

Organization

No organization information available