Supertree Construction with Constraint Programming

  • Ian P. Gent
  • Patrick Prosser
  • Barbara M. Smith
  • Wu Wei
Conference paper

DOI: 10.1007/978-3-540-45193-8_63

Volume 2833 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Gent I.P., Prosser P., Smith B.M., Wei W. (2003) Supertree Construction with Constraint Programming. In: Rossi F. (eds) Principles and Practice of Constraint Programming – CP 2003. CP 2003. Lecture Notes in Computer Science, vol 2833. Springer, Berlin, Heidelberg

Abstract

A central goal of systematics is the construction of a tree of life, where the tree represents the relationship between all living things. The leaf nodes of the tree correspond to species and the internal nodes to hypothesized species, assumed to be extinct, where species have diverged. One problem that biologists face is to assemble a supertree from many smaller trees that have overlapping leaf sets. Polytime algorithms have been proposed for this problem [3,5]. We present a simple constraint encoding of this problem. This is based on the observation that any rooted tree can be considered as being min-ultrametric when we label interior nodes with their depth in that tree. That is, any path from the root to a leaf corresponds to a strictly increasing sequence. Our encoding takes a radically different approach to solving these problems, and represents a new perspective.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Ian P. Gent
    • 1
  • Patrick Prosser
    • 2
  • Barbara M. Smith
    • 3
  • Wu Wei
    • 2
  1. 1.School of Computer ScienceUniversity of St. AndrewsScotland
  2. 2.Department of Computing ScienceUniversity of GlasgowScotland
  3. 3.School of Computing and EngineeringUniversity of HuddersfieldEngland