Two operations on trees are defined, namely up and down operations capable of lifting a given subforest up or down in a tree. Given two labelled, ordered trees T1 and T2 the up-down distance (T1, T2) is defined as the minimal number of up and down operations needed to transform T1 into T2. A linear algorithm to transform a given tree into another with the minimal number of up and down operations, as well as the lower bound proof are then derived.

Up-down distance between two trees

LUCCIO, FABRIZIO;PAGLI, LINDA
2006-01-01

Abstract

Two operations on trees are defined, namely up and down operations capable of lifting a given subforest up or down in a tree. Given two labelled, ordered trees T1 and T2 the up-down distance (T1, T2) is defined as the minimal number of up and down operations needed to transform T1 into T2. A linear algorithm to transform a given tree into another with the minimal number of up and down operations, as well as the lower bound proof are then derived.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11568/189423
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact