A constrained edit distance between unordered labeled trees
type: Item
instance of: scholarly article
title: A constrained edit distance between unordered labeled trees
zbMATH Open document ID: 0839.68035
DOI: 10.1007/BF01975866
published in: Algorithmica
publication date: 1996-03-18T00:00:00Z
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 847568
zbMATH Keywords: unordered labeled trees
zbMATH Keywords: unordered tree matching
author: Kaizhong Zhang
MaRDI profile type: Publication
cites work: Q4230322
cites work: Fast parallel and serial approximate string matching
cites work: Q2736344
cites work: The theory and computation of evolutionary distances: Pattern recognition
cites work: Threshold decomposition of gray-scale morphology into binary morphology
cites work: The Tree-to-Tree Correction Problem
cites work: Q3707420
cites work: Finding approximate patterns in strings
cites work: Some MAX SNP-hard results concerning unordered labeled trees
cites work: Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
cites work: Approximate Tree Matching in the Presence of Variable Length Don′t Cares
cites work: On the editing distance between unordered labeled trees
full work available at URL: https://doi.org/10.1007/bf01975866
OpenAlex ID: W2056708848
description: scientific article; zbMATH DE number 847568