Matching Subsequences in Trees

Philip Bille; Inge Li Goertz

Matching Subsequences in Trees

数据结构与算法 2011-11-09 v3

作者: Philip Bille , Inge Li Goertz

摘要

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.

关键词

decision tree graph algorithms string algorithms

引用

@article{arxiv.cs/0512061,
  title  = {Matching Subsequences in Trees},
  author = {Philip Bille and Inge Li Goertz},
  journal= {arXiv preprint arXiv:cs/0512061},
  year   = {2011}
}

备注

Minor correction of typos, etc

相关论文

查看更多相关论文 →