Tree Reconstruction via a Closure Operation on Partial Splits

Authors:
Charles Semple;Mike Steel
Affiliations:
-;-
Venue:
JOBIM '00 Selected papers from the First International Conference on Computational Biology, Biology, Informatics, and Mathematics
Year:
2000

Citing 2
Cited 2

Algorithmic aspects of tree amalgamation

Journal of Algorithms
Two Strikes Against Perfect Phylogeny

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming

Uncovering Hidden Phylogenetic Consensus in Large Data Sets

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Uncovering hidden phylogenetic consensus

ISBRA'10 Proceedings of the 6th international conference on Bioinformatics Research and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A fundamental problem in biological classification is the reconstruction of phylogenetic trees for a set X of species from a collection of either subtrees or qualitative characters. This task is equivalent to tree reconstruction from a set of partial X-splits (bipartitions of subsets of X). In this paper, we define and analyse a "closure" operation for partial X-splits that was informally proposed by Meacham [5]. In particular, we establish a sufficient condition for such an operation to reconstruct a tree when there is essentially only one tree that displays the partial X-splits. This result exploits a recent combinatorial result from [2].