A similarity algorithm of trees with complicated labels
- 10.2991/csss-14.2014.28How to use a DOI?
- similarity of trees; tree edit operation; mapping conditions; complicated labels; path decompositions
A tree with complicated labels can widely represent objects in the real world. In this paper, the sum of matched pair similarity is used only to measure the similarity of such trees, while omitting inserted nodes and deleted nodes in the maximum mapping conditions of edit operations. The principle of path decompositions of trees is resolved and illustrated to be based essentially on the same mapping requirements. The leftmost path decomposition is implemented as one example of the algorithms for the similarity of trees with complicated labels.
- © 2014, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Jihua Wang AU - Yiliang Liu PY - 2014/06 DA - 2014/06 TI - A similarity algorithm of trees with complicated labels BT - Proceedings of the 3rd International Conference on Computer Science and Service System PB - Atlantis Press SP - 127 EP - 130 SN - 1951-6851 UR - https://doi.org/10.2991/csss-14.2014.28 DO - 10.2991/csss-14.2014.28 ID - Wang2014/06 ER -