Survey on Subtree Matching

Author

Cserkúti, Péter ; Levendovszky, Tihamér ; Charaf, Hassan

Author_Institution

Dept. of Autom. & Appl. Informatics, Budapest Univ. of Technol. & Econ.

fYear

0

fDate

0-0 0

Firstpage

216

Lastpage

221

Abstract

The subtree matching is the problem of finding all the matching occurrences of a pattern tree in a subject tree as a subtree. This paper introduces many problems that are related to subtree matching and provides a classification of them. The basic problem has got several variations depending on the type of trees and on what we call a match. Trees can be rooted or unrooted, ordered and unordered and labeled or unlabeled. A subtree matching may mean subtree isomorphism, subtree homeomorphism, subtree inclusion or pattern matching. This paper introduces the most important algorithms for these problems while paying special attention to their complexities

Keywords

computational complexity; pattern classification; string matching; tree data structures; trees (mathematics); pattern classification; pattern tree matching occurrence; string matching; subject tree; subtree homeomorphism; subtree inclusion; subtree isomorphism; subtree matching problem; Bioinformatics; Chemistry; Design automation; Informatics; Pattern matching; Polynomials; Tree graphs; XML;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Engineering Systems, 2006. INES '06. Proceedings. International Conference on

Conference_Location

London

Print_ISBN

0-7803-9708-8

Type

conf

DOI

10.1109/INES.2006.1689372

Filename

1689372