scientific article; zbMATH DE number 7561381
From MaRDI portal
Publication:5091018
Recommendations
- New and improved algorithms for unordered tree inclusion
- A new tree inclusion algorithm
- More Efficient Algorithm for Ordered Tree Inclusion
- On Chen and Chen's new tree inclusion algorithm
- scientific article; zbMATH DE number 1972679
- Ordered and Unordered Tree Inclusion
- Automata, Languages and Programming
- A new approach to operating with undirected trees
- The tree inclusion problem
- A top down algorithm for constrained tree inclusion
Cites work
- A survey on tree edit distance and related problems
- Algorithms and Computation
- An optimal decomposition algorithm for tree edit distance
- Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees
- Color-coding
- Consequences of Faster Alignment of Sequences
- Constrained tree inclusion
- Efficient exponential-time algorithms for edit distance between unordered trees
- Exact algorithms for computing the tree edit distance between unordered trees
- Exact and approximate algorithms for unordered tree matching
- On the complexity of finding iso- and other morphisms for partial \(k\)- trees
- On the editing distance between unordered labeled trees
- Ordered and Unordered Tree Inclusion
- Some MAX SNP-hard results concerning unordered labeled trees
- Subtree isomorphism revisited
- The tree inclusion problem
- The Tree-to-Tree Correction Problem
- Tree edit distance cannot be computed in strongly subcubic time (unless APSP can)
Cited in
(3)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091018)
