New dissimilarity measure for recognizing noisy subsequence trees
From MaRDI portal
Recommendations
Cites work
- A graph distance metric based on the maximal common subgraph
- A survey on tree edit distance and related problems
- Approximate labelled subtree homeomorphism
- Computing the edit-distance between unrooted ordered trees
- Fast algorithms for the unit cost editing distance between trees
- scientific article; zbMATH DE number 3303655 (Why is no real title available?)
- On the editing distance between unordered labeled trees
- Ordered and Unordered Tree Inclusion
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
This page was built for publication: New dissimilarity measure for recognizing noisy subsequence trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2997938)