A note on some tree similarity measures. (English) Zbl 0489.68058


68R10 Graph theory (including graph drawing) in computer science
05C05 Trees
Full Text: DOI


[1] Aho, A.V.; Peterson, T.G., A minimum distance error correcting parser for context-free languages, SIAM J. comput., 1, 305-312, (1972) · Zbl 0241.68038
[2] Day, W.H.E., A new approach to constructing tree metrics, ()
[3] Hirschberg, D.S., Complexity of common subsequence problems, (), 393-398 · Zbl 0364.68054
[4] Knuth, D.E., Sorting and searching, () · Zbl 0777.68012
[5] Lyon, G., Syntax-direct least-errors analysis for context-free languages: A practical approach, Comm. ACM, 17, 3-14, (1974) · Zbl 0288.68041
[6] Moore, G.W.; Goodman, M.; Barnabas, J., An iterative approach from the standpoint of the additive hypothesis to the dendrogram problem posed by molecular data sets, J. theoret. biology, 38, 423-457, (1973)
[7] Sankoff, D., Matching sequences under deletion/insertion constraints, Proc. nat. acad. sci. USA, 69, 4-6, (1979) · Zbl 0235.05013
[8] Waterman, M.S.; Smith, T.F., On the similarity of dendograms, J. theoret. biology, 75, 789-800, (1978)
[9] Wagner, R.A.; Fischer, M.J., The string-to-string correction problem, J. ACM, 21, 168-173, (1974) · Zbl 0278.68032
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.