Author:
Guessarian I.,Cégielski P.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,General Mathematics,Statistics and Probability
Reference10 articles.
1. P. Bille, “A survey on tree edit distance and related problems,” Theoret. Comput. Sci., 337, 217–239 (2005).
2. L. Boasson, P. Cegielski, I. Guessarian, and Yu. Matiyasevich, “Window accumulated subsequence matching is linear,” Ann. Pure Appl. Logic, 113, 59–80 (2001).
3. P. Cegielski, I. Guessarian, and Yu. Matiyasevich, “Tree inclusion problems,” RAIRO, 42, No. 1, 5–20 (2008).
4. P. Cegielski, I. Guessarian, Yu. Lifshits, and Yu. Matiyasevich, “Window subsequence problems for compressed texts,” CSR’06, Lect. Notes Comput. Sci., 3697, 127–136 (2006).
5. Y. Chi, R. Muntz, S. Nijssen, and J. Kok, “Frequent subtree mining — an overview,” Fund. Inform., 66, 161–198 (2005).