Tree edit distance problems: Algorithms and applications to bioinformatics

IEICE Transactions on Information and Systems

Volumn E93-D, Issue 2, 2010, Pages 208-218

  Akutsu, Tatsuya ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

Dynamic programming; Largest common subtree; Tree alignment; Tree edit distance

Indexed keywords

APPROXIMATION ALGORITHMS; BIOINFORMATICS; DYNAMIC PROGRAMMING; POLYNOMIAL APPROXIMATION; POLYSACCHARIDES;

EFFICIENT APPROXIMATION ALGORITHMS; GLYCAN STRUCTURES; PHYLOGENETIC TREES; RNA SECONDARY STRUCTURES; SUB TREES; TREE ALIGNMENT; TREE EDIT DISTANCE; TREE-STRUCTURED DATA;

TREES (MATHEMATICS);

EID: 77950228920     PISSN: 09168532     EISSN: 17451361     Source Type: Journal    
DOI: 10.1587/transinf.E93.D.208     Document Type: Article

References (29)

1. T. Akutsu and M.M. Halldórsson, "On the approximation of largest common subtrees and largest common point sets," Theor. Comput. Sci., vol.233, pp.33-50, 2000.
2. T. Akutsu, "A relation between edit distance for ordered trees and edit distance for Euler strings," Inf. Process. Lett., vol.100, pp.105-109, 2006.
3. T. Akutsu, D. Fukagawa, and A. Takasu, "Improved approximation of the largest common subtree of two unordered trees of bounded height," Inf. Process. Lett., vol.109, pp.165-170, 2008.
4. T. Akutsu, D. Fukagawa, and A. Takasu, "Approximating tree edit distance through string edit distance," Algorithmica, to appear.
5. A. Amir, T. Hartman, O. Kapah, B.R. Shalom, and D. Tsur, "Generalized LCS," Theor. Comput. Sci., vol.409, pp.438-449, 2008.
6. K.F. Aoki, A. Yamaguchi, Y. Okuno, T. Akutsu, N. Ueda, M. Kanehisa, and H. Mamitsuka, "Efficient tree-matching methods for accurate carbohydrate database queries," Genome Informatics, vol.14, pp.134-143, 2003.
7. K.F. Aoki, A. Yamaguchi, N. Ueda, T. Akutsu, H. Mamitsuka, S. Goto, and M. Kanehisa, "KCaM (KEGG Carbohydrate Matcher): A software tool for analyzing the structure of carbohydrate sugar chains," Nucleic Acids Research, vol.32, pp.W267-W272, 2004.
8. T. Aratsu, K. Hirata, and T. Kuboyama, "Approximating tree edit distance through string edit distance for binary tree codes," Proc. 35th Conf. Current Trends in Theory and Practice of Computer Science (SOFSEM 2009), pp.93-104, 2009.
9. R. Backofen, S. Chen, D. Hermelin, G.M. Landau, M.A. Roytberg, O. Weimann, and K. Zhang, "Locality and gaps in RNA comparison," J. Computational Biology, vol.14, pp.1074-1087, 2007.
10. P. Bille, "A survey on tree edit distance and related problem," Theor. Comput. Sci., vol.337, pp.217-239, 2005.
11. D. Conte, P. Foggia, C. Sansone, and M. Vento, "Thirty years of graph matching in pattern recognition," Int. J. Pattern Recognit. Artif. Intell., vol.18, pp.265-298, 2004.
12. E. Demaine, S. Mozes, B. Rossman, and O. Weimann, "An optimal decomposition algorithm for tree edit distance," Proc. 34th International Colloquium on Automata, Languages and Programming (ICALP 2007), pp.146-157, 2007.
13. R. Durbin, S. Eddy, K. Krogh, and G. Mitchison, Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids, Cambridge University Press, Cambridge, UK, 1998.
14. D. Fukagawa, T. Akutsu, and A. Takasu, "Constant factor approximation of edit distance of bounded height unordered trees," Proc. 16th String Processing and Information Retrieval Symposium, pp.7-17, 2009.
15. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Co., New York, 1979.
16. M.M. Halldórsson and K. Tanaka, "Approximation and special cases of common subtrees and editing distance," Proc. 7th International Symposium on Algorithms and Computation (ISAAC 96), pp.75-84, 1996.
17. K. Hashimoto, S. Goto, S. Kawano, K.F. Aoki-Kinoshita, N. Ueda, M. Hamajima, T. Kawasaki, and M. Kanehisa, "KEGG as a glycome informatics resource," Glycobiology, vol.16, pp.63R-70R, 2006.
18. V.T. Hoang and W-K. Sung, "Fixed parameter polynomial time algorithms for maximum agreement and compatible supertrees," Proc. 25th International Symposium on Theoretical Aspects of Computer Science (STACS 2008), pp.361-372, 2008.
19. Y. Horesh, R. Mehr, and R. Unger, "Designing an A* algorithm for calculating edit distance between rooted-unordered trees," J. Computational Biology, vol.13, pp.1165-1176, 2006.
20. T. Jiang, L.Wang, and K. Zhang, "Alignment of trees-an alternative to tree edit," Theor. Comput. Sci., vol.143, pp.137-148, 1995.
21. M. Khaladkar, V. Bellofatto, J. T-L. Wang, B. Tian, and B.A. Shapiro, "RADAR: a web server for RNA data analysis and research," Nucleic Acids Research, vol.35, pp.W300-W304, 2007.
22. P. Kilpeläinen and H. Mannila, "Ordered and unordered tree inclusion," SIAM J. Comput., vol.24, pp.340-356, 1995.
23. P.N. Klein, "Computing the edit-distance between unrooted ordered trees," Proc. 6th European Symposium on Algorithms (ESA 98), pp.91-102, 1998.
24. T. Kuboyama, Matching and Learning in Trees, Doctoral Thesis, University of Tokyo, 2007.
25. D. Shasha, J.T-L. Wang, K. Zhang, and F.Y. Shih, "Exact and approximate algorithms for unordered tree matching," IEEE Trans. Syst., Man Cybern., vol.24, no.4, pp.668-678, 1994.
26. K-C. Tai, "The tree-to-tree correction problem," J. ACM, vol.26, pp.422-433, 1979.
27. V.V. Vazirani, Approximation Algorithms, Springer, Berlin, 2001.
28. K. Zhang and D. Shasha, "Simple fast algorithms for the editing distance between trees and related problems," SIAM J. Comput., vol.18, pp.1245-1262, 1989.
29. K. Zhang and T. Jiang, "Some MAX SNP-hard results concerning unordered labeled trees," Inf. Process. Lett., vol.49, pp.249-254, 1994.