Fast algorithms for comparison of similar unordered trees
From MaRDI portal
Recommendations
- FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES
- Alignment of trees -- an alternative to tree edit
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- A fast algorithm for optimal alignment between similar ordered trees
- scientific article; zbMATH DE number 1998340
Cited in
(15)- Approximate labelled subtree homeomorphism
- Identifying approximately common substructures in trees based on a restricted edit distance
- On the complexity of finding a largest common subtree of bounded degree
- A faster and unifying algorithm for comparing trees
- Fast Algorithms for Computing Tree LCS
- scientific article; zbMATH DE number 1998340 (Why is no real title available?)
- A fast algorithm for optimal alignment between similar ordered trees
- Faster algorithms for the maximum common subtree isomorphism problem
- A Comparison of Many Max-tree Computation Algorithms
- Approximate labelled subtree homeomorphism
- FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES
- Algorithms and Computation
- Fast algorithms for computing tree LCS
- Comparing similar ordered trees in linear-time
- Space efficient algorithms for ordered tree comparison
This page was built for publication: Fast algorithms for comparison of similar unordered trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5712135)