1995

# Tree-tree matrices and other combinatorial problems from taxonomy

## Publication

### Publication

Let A be a bipartite graph between two sets D and T. Then A defines by Hamming distance, metrics on both T and D. The question is studied which pairs of metric spaces can arise this way. If both spaces are trivial the matrix A comes from a Hadamard matrix or is a BIBD. The second question studied is in what ways A can be used to transfer (classification) information from one of the two sets to the other. These problems find their origin in mathematical taxonomy.

Additional Metadata | |
---|---|

, , , , , | |

CWI | |

Department of Analysis, Algebra and Geometry [AM] | |

Hazewinkel, M. (1995).
Tree-tree matrices and other combinatorial problems from taxonomy. Department of Analysis, Algebra and Geometry [AM]. CWI. |