Matching Subsequences in Trees

Details Matching Subsequences in Trees Matching Subsequences in Trees

2005-12-15

arxiv.org/abs/cs/0512061v3

Computer Science

Data Structures and Algorithms

Minor correction of typos, etc

Scientific paper

Given two rooted, labeled trees $P$ and $T$ the tree path subsequence problem
is to determine which paths in $P$ are subsequences of which paths in $T$. Here
a path begins at the root and ends at a leaf. In this paper we propose this
problem as a useful query primitive for XML data, and provide new algorithms
improving the previously best known time and space bounds.

Affiliated with

Also associated with

No associations

Rating

Matching Subsequences in Trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Matching Subsequences in Trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Matching Subsequences in Trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-168279