by Michalis Christou, Maxime Crochemore, Tomas Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar and Solon P. Pissis
Reference:
M. Christou, M. Crochemore, T. Flouri, C. S. Iliopoulos, J. Janousek, B. Melichar, S. P. Pissis, "Computing all subtree repeats in ordered trees", Information Processing Letters, vol. 112, no. 24, 2012, pp. 958 - 962.
Bibtex Entry:
@article{Christou2012958,
title = "Computing all subtree repeats in ordered trees ",
journal = "Information Processing Letters ",
volume = "112",
number = "24",
pages = "958 - 962",
year = "2012",
note = "",
issn = "0020-0190",
doi = "10.1016/j.ipl.2012.09.001",
author = "Michalis Christou and Maxime Crochemore and Tomas Flouri and Costas S. Iliopoulos and Jan Janousek and Borivoj Melichar and Solon P. Pissis",
}