Exact algorithms for computing the tree edit distance between unordered trees
TLDR
This paper presents a fixed-parameter algorithm for the tree edit distance problem for unordered trees under the unit cost model that works in O(2.62^[email protected]?poly(n) time and O(n^2) space, where the parameter k is the maximum bound of the edit distance and n is themaximum size of input trees.About:
This article is published in Theoretical Computer Science.The article was published on 2011-02-01 and is currently open access. It has received 30 citations till now. The article focuses on the topics: Edit distance & Time complexity.read more
Citations
More filters
Journal ArticleDOI
Tree Echo State Networks
TL;DR: Experimental results show that the TreeESN approach, in spite of its efficiency, can achieve comparable results with state-of-the-art, although more complex, neural and kernel based models for tree structured data.
Robust process mining with guarantees
TL;DR: In this thesis, three aspects of process mining are addressed: process discovery, conformance checking and enhancement.
Configuration management for models : generic methods for model comparison and model co-evolution
TL;DR: This thesis describes the research which was focused on developing methods and techniques to support generic model configuration management, and developed methods for the representation, calculation, and visualization of state-based model differences.
Book
Similarity Joins in Relational Database Systems
TL;DR: This book describes the concepts and techniques to incorporate similarity into database systems, and describes prefix, size, positional and partitioning filters, which can be used to avoid the computation of small intersections that are not needed since the similarity would be too low.
Journal ArticleDOI
Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees
TL;DR: A parameterized algorithm in terms of the number of branching nodes that solves both problems and yields polynomial algorithms for several special classes of trees and the first approximation algorithms for both problems are presented.
References
More filters
Book
Parameterized Complexity
TL;DR: An approach to complexity theory which offers a means of analysing algorithms in terms of their tractability, and introduces readers to new classes of algorithms which may be analysed more precisely than was the case until now.
Journal ArticleDOI
Fast algorithms for finding nearest common ancestors
Dov Harel,Robert E. Tarjan +1 more
TL;DR: An algorithm for a random access machine with uniform cost measure (and a bound of $\Omega (\log n)$ on the number of bits per word) that requires time per query and preprocessing time is presented, assuming that the collection of trees is static.
Journal ArticleDOI
The Tree-to-Tree Correction Problem
TL;DR: An algorithm is presented which solves the problem of determining the distance from T to T' as measured by the mlmmum cost sequence of edit operaUons needed to transform T into T'.