Identifying Approximately Common Substructures in Trees Based on a Restricted Edit Distance.
Jason Tsong-Li WangKaizhong ZhangChia-Yo ChangPublished in: Inf. Sci. (1999)
Keyphrases
- edit distance
- tree edit distance
- edit operations
- tree structured data
- graph matching
- string matching
- levenshtein distance
- approximate string matching
- string similarity
- string edit distance
- similarity measure
- distance measure
- graph edit distance
- dynamic programming
- distance computation
- triangle inequality
- decision trees
- relaxation labeling
- structured data
- pattern recognition
- dissimilarity measure
- tree structure
- distance function
- approximate matching
- pairwise
- subgraph isomorphism
- finite alphabet
- data structure