Computing All Subtree Repeats in Ordered Ranked Trees

Michalis Christou, Maxime Crochemore, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis. Computing All Subtree Repeats in Ordered Ranked Trees. In Roberto Grossi, Fabrizio Sebastiani 0001, Fabrizio Silvestri, editors, String Processing and Information Retrieval, 18th International Symposium, SPIRE 2011, Pisa, Italy, October 17-21, 2011. Proceedings. Volume 7024 of Lecture Notes in Computer Science, pages 338-343, Springer, 2011. [doi]

@inproceedings{ChristouCFIJMP11,
  title = {Computing All Subtree Repeats in Ordered Ranked 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 = {2011},
  doi = {10.1007/978-3-642-24583-1_33},
  url = {http://dx.doi.org/10.1007/978-3-642-24583-1_33},
  researchr = {https://researchr.org/publication/ChristouCFIJMP11},
  cites = {0},
  citedby = {0},
  pages = {338-343},
  booktitle = {String Processing and Information Retrieval, 18th International Symposium, SPIRE 2011, Pisa, Italy, October 17-21, 2011. Proceedings},
  editor = {Roberto Grossi and Fabrizio Sebastiani 0001 and Fabrizio Silvestri},
  volume = {7024},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-24582-4},
}