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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.