Logo image
The implementation of a visualizing tool for tree edit distance problems
Thesis

The implementation of a visualizing tool for tree edit distance problems

吳政忠
Masters, 國立清華大學, 資訊系統與應用研究所
2008

Abstract

編輯距離 比對 視覺化 Shasha Klein tree edit distance matching visualizing Shasha Klein
Study of tree edit distance problems is more and more important because of the advancement of the related study of information technology and biology. There are a lot of algorithms for tree edit distance problems. For example in 1979, first to give a formal definition to tree edit distance is Kuo-Chung Tai[6]. Then Kaizhong Zhang and Dennis Shasha[5] provide a better algorithm in 1989, and their paper becomes one of the classic papers in the field of tree edit distance problems. Philip N. Klein[8] also provides another algorithm to solve tree edit distance problems in 1998, and it improves worst case of time complexity of the algorithm[5] Zhang and Shasha provide. However, there is no related tool to visualize the result of tree edit distance problems, so it is necessary to provide a tool to visualize it. This thesis introduces a software tool. This tool can let user create trees by some methods and then do the algorithm of tree edit distance problems, and finally it provides a visualizing processes according to the result of some specific algorithm.

Metrics

1 Record Views

Details

Logo image