Trees are a useful framework for classifying entities whose attributes are, at least partially, related through a common ancestry, such as species of organisms, family members or languages. In some common applications, such as phylogenetic trees based on DNA sequences, relatedness can be inferred from the statistical analysis of unweighted attributes.
In this paper we present a Constraint Programming approach that can enforce consistency
between bounds on the relative weight of each trait and tree topologies, so that the user ...
|Title of host publication||Lecture notes in computer science|
|Publication status||Published - 1 Jan 2011|
|Event||4th international conference on Interplay between natural and artificial computation - |
Duration: 1 Jan 2011 → …
|Conference||4th international conference on Interplay between natural and artificial computation|
|Period||1/01/11 → …|