An optimal decomposition algorithm for tree edit distance
From MaRDI portal
Publication:2930275
DOI10.1145/1644015.1644017zbMath1300.68057arXivcs/0604037OpenAlexW2171643895WikidataQ60143028 ScholiaQ60143028MaRDI QIDQ2930275
No author found.
Publication date: 18 November 2014
Published in: (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0604037
No records found.
No records found.
Related Items (17)
Tai mapping hierarchy for rooted labeled trees through common subforest ⋮ On the hardness of computing the edit distance of shallow trees ⋮ Unnamed Item ⋮ Inexact tree pattern matching with 1-degree edit distance using finite automata ⋮ Mining approximate patterns with frequent locally optimal occurrences ⋮ Efficient chaining of seeds in ordered trees ⋮ Efficient exponential-time algorithms for edit distance between unordered trees ⋮ Efficient Chaining of Seeds in Ordered Trees ⋮ Modeling dynamic programming problems over sequences and trees with inverse coupled rewrite systems ⋮ Improved MAX SNP-Hard Results for Finding an Edit Distance between Unordered Trees ⋮ Algorithms for finding a most similar subforest ⋮ An improved algorithm for tree edit distance with applications for RNA secondary structure comparison ⋮ Unnamed Item ⋮ New and improved algorithms for unordered tree inclusion ⋮ Alignment distance of regular tree languages ⋮ Alignment distance of regular tree languages ⋮ On the complexity of finding a largest common subtree of bounded degree
This page was built for publication: An optimal decomposition algorithm for tree edit distance
