Computing all subtree repeats in ordered trees

Christou, Michalis; Crochemore, Maxime; Flouri, Tomas; Iliopoulos, Costas S.; Janousek, Jan; Melichar, Borivoj; Pissis, Solon P.

by Michalis Christou, Maxime Crochemore, Tomas Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis

Reference:

Computing all subtree repeats in ordered trees (Michalis Christou, Maxime Crochemore, Tomas Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis), In Information Processing Letters, volume 112, 2012.

Bibtex Entry:

@article{subtreerep,
author = "Michalis Christou and Maxime Crochemore and Tomas Flouri and Costas S. Iliopoulos and Jan Janousek and Borivoj Melichar and Solon P. Pissis",
title = "Computing all subtree repeats in ordered trees",
year = "2012",
journal = "Information Processing Letters",
volume = "112",
number = "24",
pages = "958--962"
}