Simple and efficient tree comparison
A new distance metric for rooted trees is presented which is based on the largest common forest of two rooted trees. The new measure is superior to previous measures based on tree edit distance, because no particular tree edit operations together with their costs or weights need to be defined. The m...
| Autor: | |
|---|---|
| Formato: | informe técnico |
| Fecha de publicación: | 2001 |
| País: | España |
| Recursos: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/97629 |
| Acesso em linha: | https://hdl.handle.net/2117/97629 |
| Access Level: | acceso abierto |
| Palavra-chave: | Design and analysis of algorithms Combinatorial problems Graph algorithms Pattern matching Tree pattern matching Tree isomorphism Subtree isomorphism Edit distance Metric space Largest common forest Àrees temàtiques de la UPC::Informàtica |
| Resumo: | A new distance metric for rooted trees is presented which is based on the largest common forest of two rooted trees. The new measure is superior to previous measures based on tree edit distance, because no particular tree edit operations together with their costs or weights need to be defined. The metric can be computed in expected time linear in the number of nodes, on rooted trees of unbounded degree, either unordered or ordered, labeled or unlabeled. An algorithm for computing the metric is given which is based on a simple and efficient bottom-up algorithm for finding all common rooted subtrees in a forest. |
|---|