Sciweavers

Share
SIGMOD
2004
ACM

An Optimal Algorithm for Querying Tree Structures and its Applications in Bioinformatics

11 years 11 months ago
An Optimal Algorithm for Querying Tree Structures and its Applications in Bioinformatics
Trees and graphs are widely used to model biological databases. Providing efficient algorithms to support tree-based or graph-based querying is therefore an important issue. In this paper, we propose an optimal algorithm which can answer the following question: "Where do the root-to-leaf paths of a rooted labeled tree Q occur in another rooted labeled tree T?" in time O(m + Occ), where m is the size of Q and Occ is the output size. We also show the problem of querying a general graph is NP-complete and not approximable within nk for any k < 1, where n is the number of nodes in the queried graph, unless P = NP.
Hsiao-Fei Liu, Ya-Hui Chang, Kun-Mao Chao
Added 08 Dec 2009
Updated 08 Dec 2009
Type Conference
Year 2004
Where SIGMOD
Authors Hsiao-Fei Liu, Ya-Hui Chang, Kun-Mao Chao
Comments (0)
books