Computing all subtree repeats in ordered trees

Michalis Christou, Maxime Crochemore, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis. Computing all subtree repeats in ordered trees. Inf. Process. Lett., 112(24):958-962, 2012. [doi]

@article{ChristouCFIJMP12,
  title = {Computing all subtree repeats in ordered trees},
  author = {Michalis Christou and Maxime Crochemore and Tomás Flouri and Costas S. Iliopoulos and Jan Janousek and Borivoj Melichar and Solon P. Pissis},
  year = {2012},
  doi = {10.1016/j.ipl.2012.09.001},
  url = {http://dx.doi.org/10.1016/j.ipl.2012.09.001},
  researchr = {https://researchr.org/publication/ChristouCFIJMP12},
  cites = {0},
  citedby = {0},
  journal = {Inf. Process. Lett.},
  volume = {112},
  number = {24},
  pages = {958-962},
}