Computing All Subtree Repeats in Ordered Ranked Trees

Michalis Christou, Maxime Crochemore, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis. Computing All Subtree Repeats in Ordered Ranked Trees. In Roberto Grossi, Fabrizio Sebastiani 0001, Fabrizio Silvestri, editors, String Processing and Information Retrieval, 18th International Symposium, SPIRE 2011, Pisa, Italy, October 17-21, 2011. Proceedings. Volume 7024 of Lecture Notes in Computer Science, pages 338-343, Springer, 2011. [doi]

Authors

Michalis Christou

This author has not been identified. Look up 'Michalis Christou' in Google

Maxime Crochemore

This author has not been identified. Look up 'Maxime Crochemore' in Google

Tomás Flouri

This author has not been identified. Look up 'Tomás Flouri' in Google

Costas S. Iliopoulos

This author has not been identified. Look up 'Costas S. Iliopoulos' in Google

Jan Janousek

This author has not been identified. Look up 'Jan Janousek' in Google

Borivoj Melichar

This author has not been identified. Look up 'Borivoj Melichar' in Google

Solon P. Pissis

This author has not been identified. Look up 'Solon P. Pissis' in Google