Faster algorithms for guided tree edit distance
type: Item
instance of: scholarly article
title: Faster algorithms for guided tree edit distance
zbMATH Open document ID: 1191.68213
author: Dekel Tsur
published in: Information Processing Letters
publication date: 2010-06-09T00:00:00Z
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 5719192
zbMATH Keywords: design of algorithms
zbMATH Keywords: string algorithms
zbMATH Keywords: edit distance
zbMATH Keywords: ordered trees
MaRDI profile type: Publication
full work available at URL: j.ipl.2008.05.014
OpenAlex ID: W2008865991
cites work: More algorithms for all-pairs shortest paths in weighted graphs
cites work: New algorithm for ordered tree-to-tree correction problem
cites work: An Optimal Decomposition Algorithm for Tree Edit Distance
cites work: Q4252025
cites work: Guided Forest Edit Distance: Better Structure Comparisons by Using Domain-knowledge
cites work: The Tree-to-Tree Correction Problem
cites work: Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
DOI: 10.1016/J.IPL.2008.05.014
description: scientific article; zbMATH DE number 5719192