Computing All Subtree Repeats in Ordered Ranked 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 Ranked Trees (Michalis Christou, Maxime Crochemore, Tomas Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis), In String Processing and Information Retrieval (Roberto Grossi, Fabrizio Sebastiani, Fabrizio Silvestri, eds.), Springer Berlin / Heidelberg, volume 7024, 2011.

Bibtex Entry:

@inproceedings{SPIRE_2011,
   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 Ranked Trees",
   booktitle = "String Processing and Information Retrieval",
   series = "Lecture Notes in Computer Science",
   editor = "Roberto Grossi and Fabrizio Sebastiani and Fabrizio Silvestri",
   publisher = "Springer Berlin / Heidelberg",
   pages = "338--343",
   volume = "7024",
   year = "2011"
}