Skip to main content

Tree Reconstruction via a Closure Operation on Partial Splits

  • Conference paper
  • First Online:
Computational Biology (JOBIM 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2066))

Included in the following conference series:

Abstract

A fundamental problem in biological classiffication 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].

This work was supported by the New Zealand Marsden Fund (UOC-MIS-003).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Böcker, S., Bryant, D., Dress, A. W. M., and Steel, M. A.: Algorithmic aspects of tree amalgamation. To appear in Journal of Algorithms.

    Google Scholar 

  2. Böcker, S., Dress, A. W. M., and Steel, M.: Patching up X-trees. Annals of Combinatorics 3 (1999) 1–12.

    Article  MATH  MathSciNet  Google Scholar 

  3. Bodlaender, H. L., Fellows, M. R., and Warnow, T. J.: Two strikes against perfect phylogeny. In Proceedings of the International Colloquium on Automata, Languages and Programming, Vol. 623 of Lecture Notes in Computer Science, Springer-Verlag, Berlin (1993) 273–283.

    Google Scholar 

  4. Buneman, P.: The recovery of trees from measures of dissimilarity. In F. R. Hodson, D. G. Kendall, and P. Tautu (eds.): Mathematics in the Archaeological and Historical Sciences, Edinburgh University Press (1971) 387–395.

    Google Scholar 

  5. Meacham, C. A.: Theoretical and computational considerations of the compatibility of qualitative taxonomic characters. In J. Felsenstein (ed.): Numerical Taxonomy, NATO ASI Series Vol. G1, Springer-Verlag (1983) 304–314.

    Google Scholar 

  6. Steel, M.: The complexity of reconstructing trees from qualitative characters and subtrees. Journal of Classification 9(1) (1992) 91–116.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Semple, C., Steel, M. (2001). Tree Reconstruction via a Closure Operation on Partial Splits. In: Gascuel, O., Sagot, MF. (eds) Computational Biology. JOBIM 2000. Lecture Notes in Computer Science, vol 2066. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45727-5_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-45727-5_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42242-6

  • Online ISBN: 978-3-540-45727-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics