Author:
Kawaguchi Taiga,Yoshino Takuya,Hirata Kouichi
Publisher
Springer International Publishing
Reference19 articles.
1. Akutsu, T., Fukagawa, D., Halldórsson, M.M., Takasu, A., Tanaka, K.: Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees. Theoret. Comput. Sci. 470, 10–22 (2013)
2. Chawathe, S.S.: Comparing hierarchical data in external memory. In: Proceedings of VLDB 1999, pp. 90–101 (1999)
3. Demaine, E.D., Mozes, S., Rossman, B., Weimann, O.: An optimal decomposition algorithm for tree edit distance. ACM Trans. Algo. 6(1), 2 (2009)
4. Gollapudi, S., Panigrahy, S.: The power of two min-hashes for similarity search among hierarchical data objects. In: Proceedings of PODS 2008, pp. 211–219 (2008)
5. Lecture Notes in Computer Science;K Hirata,2011