Approximate Tree Matching in the Presence of Variable Length Don′t Cares

DOI10.1006/JAGM.1994.1003zbMATH Open0803.68038OpenAlexW1967118885MaRDI QIDQ4289840FDOQ4289840

Kaizhong Zhang, Dennis Shasha, Jason T. L. Wang

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

Recommendations

• Exact and approximate algorithms for unordered tree matching
• An efficient algorithm for some tree matching problems
• On improving matchings in trees, via bounded-length augmentations
• scientific article; zbMATH DE number 826058
• A More Efficient Approximation Scheme for Tree Alignment
• Partial Match Queries in Random k-d Trees
• Approximate matching for two families of trees
• scientific article; zbMATH DE number 1559523
• On treewidth approximations

zbMATH Keywords

approximate matchingpattern matchingstring matchingtree matchingordered labeled trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Parallel algorithms in computer science (68W10)

Cited In (10)

• Identifying consensus of trees through alignment
• Title not available (Why is that?)
• Title not available (Why is that?)
• A survey on tree edit distance and related problems
• A constrained edit distance between unordered labeled trees
• Algorithms for approximate graph matching
• Title not available (Why is that?)
• Identifying approximately common substructures in trees based on a restricted edit distance
• A metric normalization of tree edit distance
• Approximate XML structure validation based on document-grammar tree similarity

This page was built for publication: Approximate Tree Matching in the Presence of Variable Length Don′t Cares

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4289840)