• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Computing all subtree repeats in ordered trees.

Michalis ChristouMaxime CrochemoreTomás FlouriCostas S. IliopoulosJan JanousekBorivoj MelicharSolon P. Pissis
Published in: Inf. Process. Lett. (2012)
Keyphrases
  • ordered trees
  • semi structured data
  • data structure
  • structured data
  • semi structured
  • partial order
  • equivalence class
  • unordered trees
  • labeled trees