论文信息 - Computing all subtree repeats in ordered trees

Computing all subtree repeats in ordered trees

We consider the problem of computing all subtree repeats in a given labeled ordered tree. We first transform the tree to a string representing its postfix notation, and then present an algorithm based on the bottom-up technique to solve it. The proposed algorithm consists of two phases: the preprocessing phase and the phase where all subtree repeats are computed. The linear time and space complexity of the proposed algorithm are important parts of its quality.

[1] David R. Barstow,et al. Interactive programming environments , 1984, SOEN.

[2] Borivoj Melichar,et al. Computing All Subtree Repeats in Ordered Ranked Trees , 2011, SPIRE.

[3] D. Knuth,et al. Simple Word Problems in Universal Algebras , 1983 .

[4] Reinhard Wilhelm,et al. Tree automata for code selection , 1994, Acta Informatica.

[5] Giancarlo Mauri,et al. Algorithms for pattern matching and discovery in RNA secondary structure , 2005, Theor. Comput. Sci..

[6] Alfred V. Aho,et al. Compilers: Principles, Techniques, and Tools (2nd Edition) , 2006 .

[7] Borivoj Melichar,et al. Arbology: Trees and pushdown automata , 2010, Kybernetika.

[8] Robert E. Tarjan,et al. Variations on the Common Subexpression Problem , 1980, J. ACM.

[9] Alfred V. Aho,et al. Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

[10] Christoph M. Hoffmann,et al. Programming with Equations , 1982, TOPL.

[11] Roberto Grossi,et al. On Finding Commong Subtrees , 1993, Theor. Comput. Sci..

[12] Maxime Crochemore,et al. An Optimal Algorithm for Computing the Repetitions in a Word , 1981, Inf. Process. Lett..

[13] Jan Janousek,et al. String Suffix Automata and Subtree Pushdown Automata , 2009, Stringology.

[14] Paul Hudak,et al. Conception, evolution, and application of functional programming languages , 1989, CSUR.