Abstract
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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Bille, P., & Gørtz, I. L. (2006). Matching subsequences in trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3998 LNCS, pp. 248–259). Springer Verlag. https://doi.org/10.1007/11758471_25
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
