Name
Abstract | ||
|---|---|---|
In this paper, we improve the A* algorithm for computing the edit distance between rooted labeled unordered trees designed by Higuchi et al. (2012) by using the dynamic programming technique, which we call the dynamic programming A* algorithm. Then, we give experimental results for glycan data by comparing the dynamic programming A* algorithm with the original A* algorithm, the exhaustive search algorithm and the clique-based algorithm. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/IIAI-AAI.2013.71 | IIAI-AAI |
Keywords | Field | DocType |
dynamic programming,trees (mathematics),clique-based algorithm,dynamic programming A* algorithm,exhaustive search algorithm,rooted labeled unordered trees,unordered tree edit distance computing,A* algorithm,Tai mapping,dynamic programming A* algorithm,unordered tree edit distance | Edit distance,Dynamic programming,Ramer–Douglas–Peucker algorithm,Simplex algorithm,Computer science,Wagner–Fischer algorithm,Algorithm,Theoretical computer science,FSA-Red Algorithm,Needleman–Wunsch algorithm,A* search algorithm | Conference |
Citations | PageRank | References |
0 | 0.34 | 12 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Takuya Yoshino | 1 | 4 | 4.54 |
| Shoichi Higuchi | 2 | 4 | 2.79 |
| Kouichi Hirata | 3 | 130 | 32.04 |