Computing All Subtree Repeats in Ordered Ranked Trees

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

doi:10.1007/978-3-642-24583-1_33

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

Reference:

M. Christou, M. Crochemore, T. Flouri, C. Iliopoulos, J. Janousek, B. Melichar, S. Pissis, "Computing All Subtree Repeats in Ordered Ranked Trees", in String Processing and Information Retrieval, R. Grossi, F. Sebastiani, F. Silvestri, Eds., Springer Berlin / Heidelberg, 2011, pp. 338-343.

Bibtex Entry:

@incollection {springerlink:10.1007/978-3-642-24583-1_33,
   author = {Christou, Michalis and Crochemore, Maxime and Flouri, Tomas and Iliopoulos, Costas and Janousek, Jan and Melichar, Borivoj and Pissis, Solon},
   title = {Computing All Subtree Repeats in Ordered Ranked Trees},
   booktitle = {String Processing and Information Retrieval},
   series = {Lecture Notes in Computer Science},
   editor = {Grossi, Roberto and Sebastiani, Fabrizio and Silvestri, Fabrizio},
   publisher = {Springer Berlin / Heidelberg},
   isbn = {978-3-642-24582-4},
   pages = {338-343},
   volume = {7024},
   doi = {10.1007/978-3-642-24583-1_33},
   year = {2011}
}