A matching algorithm in PMWL based on CluTree
From MaRDI portal
Recommendations
- An efficient algorithm for some tree matching problems
- Exact and approximate algorithms for unordered tree matching
- Algorithms for stable matching and clustering in a grid
- Parallel computation of matchings in trees
- TWO RELATED ALGORITHMS FOR ROOT-TO-FRONTIER TREE PATTERN MATCHING
- A sufficiently fast algorithm for finding close to optimal clique trees
- The clustering matroid and the optimal clustering tree
- A Linear Algorithm for Computing of a Minimum Weight Maximal Induced Matching in an Edge-Weighted Tree
- A linear algorithm for computing of a minimum weight maximal induced matching in an edge-weighted tree
Cites work
- scientific article; zbMATH DE number 3471577 (Why is no real title available?)
- scientific article; zbMATH DE number 1754502 (Why is no real title available?)
- scientific article; zbMATH DE number 2119723 (Why is no real title available?)
- An algorithm for string matching with a sequence of don't cares
- Dictionary matching and indexing with errors and don't cares
- Finding approximate repetitions under Hamming distance.
- Matching a set of strings with variable length don't cares
- Non-standard stringology: algorithms and complexity
Cited in
(2)
This page was built for publication: A matching algorithm in PMWL based on CluTree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q265007)