Window-accumulated subsequence matching problem is linear, Annals of Pure and Applied Logic, vol.113, issue.1-3, pp.59-80, 2001. ,
DOI : 10.1016/S0168-0072(01)00051-3
Tree inclusion problems, submitted, 2007. ,
Frequent subtree mining ? an overview, Fundamenta Informaticae, pp.161-198, 2005. ,
First-order queries on structures of bounded degree are computable with constant delay, ACM Transactions on Computational Logic, vol.8, issue.4, 2006. ,
DOI : 10.1145/1276920.1276923
URL : https://hal.archives-ouvertes.fr/hal-00195016
Ordered and Unordered Tree Inclusion, SIAM Journal on Computing, vol.24, issue.2, pp.340-356, 1992. ,
DOI : 10.1137/S0097539791218202