Article

Tree-Tree Matrices and Other Combinatorial Problems from Taxonomy.

Eur. J. Comb 01/1996; 17:191-208. DOI:1874/71588 pp.191-208
Source: DBLP

ABSTRACT 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.

0 0
 · 
0 Bookmarks
 · 
10 Views
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.