Optimal mappings with minimum number of connected components in tree-to-tree comparison problems

Authors:
Pascal Ferraro;Christophe Godin
Affiliations:
Université Bordeaux-1, LaBRI, 351, Cours de la Libération, 33405 Talence cedex, France;UMR Cirad/Inra/Cnrs AMAP, TA40/PSII, Bd de la Lironde, 34398 Montpellier cedex 5, France
Venue:
Journal of Algorithms
Year:
2003

Citing 7
Cited 0

Data structures and network algorithms

Data structures and network algorithms
The tree inclusion problem

TAPSOFT '91 Proceedings of the international joint conference on theory and practice of software development on Colloquium on trees in algebra and programming (CAAP '91): vol 1
Some MAX SNP-hard results concerning unordered labeled trees

Information Processing Letters
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Journal of the ACM (JACM)
The String-to-String Correction Problem

Journal of the ACM (JACM)
The Tree-to-Tree Correction Problem

Journal of the ACM (JACM)
A New Editing based Distance between Unordered Labeled Trees

CPM '93 Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider the problem of finding a minimum cost mapping between two unordered trees which induces a graph with a minimum number of connected components. The proposed algorithm is based on the generalization of an algorithm for computing an edit distance between trees, and it solves the stated problem in sequential time precisely in O(|T1| × |T2| × (degT1 + deg T2) × log2 (deg T1 + deg T2)).