Tree template matching in unranked ordered trees

Journal of Discrete Algorithms - Tập 20 - Trang 51-60 - 2013
Michalis Christou1, Tomáš Flouri2, Costas S. Iliopoulos1,3, Jan Janoušek2, Bořivoj Melichar2, Solon P. Pissis4,5, Jan Žďárek2
1Dept. of Informatics, Kingʼs College London, UK
2Dept. of Theoretical Computer Science, Czech Technical University in Prague, Czech Republic
3Dept. of Mathematics & Statistics, University of Western Australia, Australia
4Heidelberg Institute for Theoretical Studies, Germany
5Florida Museum of Natural History, University of Florida, USA

Tài liệu tham khảo

Aho, 1985, Efficient tree pattern matching (extended abstract): An aid to code generation, 334 Chase, 1987, An improvement to bottom-up tree pattern matching, 168 L.G.W.A. Cleophas, Tree algorithms: Two taxonomies and a toolkit, Ph.D. thesis, 2008. Flouri, 2010, Subtree matching by pushdown automata, Computer Science and Information Systems, 7, 331, 10.2298/CSIS1002331F Flouri, 2011, Tree template matching in ranked ordered trees by pushdown automata, vol. 6807, 273 Flouri, 2012, Tree template matching in ranked ordered trees by pushdown automata, Journal of Discrete Algorithms, 17, 15, 10.1016/j.jda.2012.10.003 Fraser, 1992, Burg: Fast optimal instruction selection and tree parsing, SIGPLAN Notices, 27, 68, 10.1145/131080.131089 Glanville, 1978, A new method for compiler code generation, 231 Hoffmann, 1982, Pattern matching in trees, Journal of ACM, 29, 68, 10.1145/322290.322295 Janoušek, 2009, On regular tree languages and deterministic pushdown automata, Acta Informatica, 46, 533, 10.1007/s00236-009-0104-9 H.H. Kron, Tree templates and subtree transformational grammars, Ph.D. thesis, 1975. T. Kuboyama, Matching and learning in trees, Ph.D. thesis, 2008. Mauri, 2005, Algorithms for pattern matching and discovery in RNA secondary structure, Theoretical Computer Science, 335, 29, 10.1016/j.tcs.2004.12.015 Shankar, 2000, A new algorithm for linear regular tree pattern matching, Theoretical Computer Science, 242, 125, 10.1016/S0304-3975(98)00205-9