A note on some tree similarity measures

Information Processing Letters

Volumn 15, Issue 1, 1982, Pages 39-42

  Culik II, Karel ^a   Wood, Derick ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b MCMASTER UNIVERSITY   (Canada)

Author keywords

similarity measure; Tree

Indexed keywords

DATA PROCESSING - DATA STRUCTURES;

TREE SIMILARITY MEASURES;

MATHEMATICAL TECHNIQUES - TREES;

EID: 0020173437     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(82)90083-7     Document Type: Article

References (9)

1. A minimum distance error correcting parser for context-free languages
2. A new approach to constructing tree metrics
3. Complexity of common subsequence problems
4. Sorting and Searching
5. Syntax-direct least-errors analysis for context-free languages A practical approach
6. An iterative approach from the standpoint of the additive hypothesis to the dendrogram problem posed by molecular data sets
7. Matching sequences under deletion/insertion constraints
8. On the similarity of dendograms
9. The string-to-string correction problem