Trees related to realizations of distance matrices Original Research Article

Let D be a distance matrix. We use heuristics for finding the largest tree that realizes a submatrix of D, or for decomposing D in a minimum number of tree-realizable submatrices.