1. Boland, R. P. 1982. Determining distances between labeled binary trees. B.Sc. Honours Thesis. Dept. of Computer Science, Memorial Univ. of Newfoundland, St. John’s, Nfld., Canada.
2. Boland, R. P., E. K. Brown, and W. H. E. Day. 1982. Approximating minimum-length-sequence metrics: a cautionary note. Mathematical Social Sciences (to appear).
3. Boorman, S. A., and D. C. Olivier, 1973. Metrics on spaces of finite trees. J. Math. Psychol. 10: 26–59.
4. Bourque, M. 1978. Arbres de Steiner et reseaux dont certains sommets sont a localisation variable. Ph.D. Thesis. Universite de Montreal, Montreal, Quebec, Canada.
5. Brown, E. K. 1982. Some closest partitions distances between trees. B.Sc. Honours Thesis. Dept. of Computer Science, Memorial Univ. of Newfoundland, St. John’s, Nfld., Canada.