The q-gram distance for ordered unlabeled trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3735 LNAI, Issue , 2005, Pages 189-202

  Ohkura, Nobuhito ^a   Hirata, Kouichi ^a   Kuboyama, Tetsuji ^b   Harao, Masateru ^a  

^a KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

^b UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; MATHEMATICAL MODELS; NUMBER THEORY;

LINE GRAPH; ORDERED UNLABELED TREES;

TREES (MATHEMATICS);

EID: 33745315005     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11563983_17     Document Type: Conference Paper

References (19)

1. T. Asai, K. Abe, S. Kawazoe, H. Arimura, H. Sakamoto, S. Arikawa: Efficient substructure discovery from large semi-structured data, Proc. SDM'02, 2002.
2. T. Asai, H. Arimura, S. Nakano, T. Uno: Discovering frequent substructures in large unordered trees, Proc. DS'03, LNAI 2843, 47-61, 2003.
3. P. Bille: A survey on tree edit distance and related problems, Theor. Comput. Sci. 337, 217-239, 2005.
4. S. Burkhardt, J. Karkkainen: Better filtering with gapped q-grams, Proc. CPM'01, LNCS 2089, 73-85, 2001.
5. K. Furukawa, T. Uchida, K. Yamada, T. Miyahara, T. Shoudai, Y. Nakamura: Extracting characteristic structures among words in semistructured documents, Proc. PAKDD'02, LNAI 2336, 351-360, 2002.
6. M. Garofalakis, A. Kumar. Correlating XML data streams using tree-edit distance embeddings, Proc. PODS'03, 143-154, 2003.
7. D. Ikeda, Y. Yamada, S. Hirokawa: Eliminating useless parts in semi-structured documents using alternation counts, Proc. DS'Ol, LNAI 2226, 113-127, 2001.
8. P. Jokinen, E. Ukkonen: Two algorithms for approximate string matching in static texts, Proc. MFCS'91, LNCS 520, 240-248, 1991.
9. T. Kuboyama, K. Shin, T. Miyahara, H. Yasuda: A theoretical analysis of alignment and edit problems for trees, Proc. ICTCS'05, LNCS, 2005 (to appear).
10. S. Nakano, T. Uno: Efficient generation of rooted trees, National Institute of Informatics Technical Report NII-2003-005E, 2003.
11. S. Nakano, T. Uno: Constant time generation of trees with specified diameter, Proc. WG'04, LNCS 3383, 33-45, 2004.
12. G Navarro, E Sutinen, J Tanninen, J Tarhio: Indexing text with approximate q-grams, Proc. CPM'00, LNCS 1848, 350-363, 2000.
13. S. M. Selkow: The tree-to-tree editing problem, Inform. Proc. Let. 6, 184-186, 1997.
14. D. Shasha, K. Zhang: Fast algorithms for the unit cost edit distance between trees, J. Algo. 11, 581-621, 1990.
15. T. Uchida, T. Mogawa, Y. Nakamura: Finding frequent structural features among words in tree-structured documents, Proc. PAKDD'04, LNAI 3056, 351-360, 2004.
16. E. Ukkonen: Approximate string-matching with q-grams and maximal matches, Theor. Comput. Sci. 92, 191-211, 1993.
17. W. Yang: Identifying syntactic differences between two programs, Software-Practice and Experience 21, 739-755, 1991.
18. M. J. Zaki: Efficiently mining frequent trees in a forest, Proc. SIGKDD'02, 71-80, 2002.
19. K. Zhang, D. Shasha: Tree pattern matching, in: A. Apostolico, Z. Galil (eds): Pattern matching algorithms, 341-371, 1997.