Cyclic Permutations and Evolutionary Trees


Given a tree T with leaf set X, there are certain ways of arranging the elements of X in a circular order so that T can be embedded in the plane and `preserve' this ordering. We investigate some new combinatorial properties of these `circular orderings.' We then use these properties to establish two results concerning dissimilarity maps on X that are induced by edge-weighted trees with leaf set X

Similar works

Full text



Last time updated on 22/10/2014

This paper was published in CiteSeerX.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.