Computing and Library Services - delivering an inspiring information environment

Supertree construction with constraint programming

Gent, Ian P., Prosser, Patrick, Smith, Barbara M. and Wei, Wu (2004) Supertree construction with constraint programming. In: Principles and Practice of Constraint Programming – CP 2003. Lecture Notes in Computer Science, 2833/2 . Springer, Heidelberg, pp. 837-841. ISBN 978-3-540-20202-8

Metadata only available from this repository.


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

Item Type: Book Chapter
Additional Information: Proceedings of the 9th International Conference on Principles and Practice of Constraint Programming (CP '03), Cork, Ireland, 2003
Subjects: T Technology > T Technology (General)
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Schools: School of Computing and Engineering
Depositing User: Briony Heyhoe
Date Deposited: 13 Aug 2008 15:54
Last Modified: 28 Aug 2021 10:40


Downloads per month over past year

Repository Staff Only: item control page

View Item View Item

University of Huddersfield, Queensgate, Huddersfield, HD1 3DH Copyright and Disclaimer All rights reserved ©