Approximate Tree Matching in the Presence of Variable Length Don′t Cares
From MaRDI portal
Publication:4289840
DOI10.1006/jagm.1994.1003zbMath0803.68038OpenAlexW1967118885MaRDI QIDQ4289840
Zhang, Kaizhong, Dennis Shasha, Wang, Jason T. L.
Publication date: 2 January 1995
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1994.1003
Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Parallel algorithms in computer science (68W10)
Related Items
Algorithms for approximate graph matching ⋮ A constrained edit distance between unordered labeled trees ⋮ A metric normalization of tree edit distance ⋮ Identifying approximately common substructures in trees based on a restricted edit distance ⋮ Approximate XML structure validation based on document-grammar tree similarity ⋮ Identifying consensus of trees through alignment ⋮ A survey on tree edit distance and related problems
