Approximate Tree Matching in the Presence of Variable Length Don′t Cares
From MaRDI portal
Publication:4289840
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
Cited in
(10)- Algorithms for approximate graph matching
- Identifying consensus of trees through alignment
- A survey on tree edit distance and related problems
- A metric normalization of tree edit distance
- scientific article; zbMATH DE number 1690133 (Why is no real title available?)
- Identifying approximately common substructures in trees based on a restricted edit distance
- scientific article; zbMATH DE number 1966526 (Why is no real title available?)
- Approximate XML structure validation based on document-grammar tree similarity
- A constrained edit distance between unordered labeled trees
- scientific article; zbMATH DE number 826058 (Why is no real title available?)
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)