Skip to Main content Skip to Navigation
Conference papers

Computing all Subtree Repeats in Ordered Ranked Trees

Michalis Christou 1 Maxime Crochemore 1, 2 Tomas Flouri 3 Costas S. Iliopoulos 1 Jan Janousek 3 Borivoj Melichar 3 Solon P. Pissis 1 
1 Informatics
2 LIGM - Laboratoire d'Informatique Gaspard-Monge
3 TCS-CTU - Department of Theoretical Computer Science
Document type :
Conference papers
Complete list of metadata
https://hal-upec-upem.archives-ouvertes.fr/hal-00742065
Contributor : Maxime Crochemore Connect in order to contact the contributor
Submitted on : Monday, October 15, 2012 - 5:44:03 PM
Last modification on : Saturday, January 15, 2022 - 3:58:05 AM

Identifiers

  • HAL Id : hal-00742065, version 1

Collections

ENPC | UPEC-UPEM | CNRS | UNIV-MLV | LIGM_ALGO | PARISTECH | LIGM | LIGM_MOA

Citation

Michalis Christou, Maxime Crochemore, Tomas Flouri, Costas S. Iliopoulos, Jan Janousek, et al.. Computing all Subtree Repeats in Ordered Ranked Trees. SPIRE, 2011, Pisa, Italy. pp.338-343. ⟨hal-00742065⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

49