论文信息 - Minimally colored trees.

Minimally colored trees.

Each edge in a weighted colored tree has a nonnegative weight corresponding to the colors of its incident vertices. The sum of these weights is the weight of the tree. Algorithms of O(n) are known to find minimal colorings, that is, to assign colors from a given finite set to the vertices of a tree so as to minimize the weight of the tree. In this paper generating functions are used to find the number of minimal colorings and the average weight of each edge over such colorings, also using O(n) operations. Applications to evolutionary trees are given.

[1] David Sankoff,et al. Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison , 1983 .

[2] D. Sankoff. Minimal Mutation Trees of Sequences , 1975 .

[3] L. Foulds,et al. Testing the theory of evolution by comparing phylogenetic trees constructed from five different protein sequences , 1982, Nature.

[4] W. Fitch. Toward Defining the Course of Evolution: Minimum Change for a Specific Tree Topology , 1971 .

[5] David Sankoff,et al. Locating the vertices of a steiner tree in an arbitrary metric space , 1975, Math. Program..

[6] J. Hartigan. MINIMUM MUTATION FITS TO A GIVEN TREE , 1973 .