Computing All Subtree Repeats in Ordered Ranked Trees.

@inproceedings{christou-2011-computing, author = {Michalis Christou and Maxime Crochemore and Tom\'{a}s Flouri and Costas S. Iliopoulos and Jan Janousek and Borivoj Melichar and Solon P. Pissis}, editor = {Roberto Grossi and Fabrizio Sebastiani and Fabrizio Silvestri}, title = {{Computing All Subtree Repeats in Ordered Ranked Trees}}, booktitle = {{String Processing and Information Retrieval, 18th International Symposium, SPIRE 2011, Pisa, Italy, October 17-21, 2011. Proceedings}}, series = {Lecture Notes in Computer Science}, volume = {7024}, pages = {338--343}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-24583-1_33}, doi = {https://doi.org/10.1007/978-3-642-24583-1_33} }