Algorithms for finding a most similar subforest
From MaRDI portal
Publication:538470
Recommendations
Cites work
- scientific article; zbMATH DE number 1305084 (Why is no real title available?)
- scientific article; zbMATH DE number 1998340 (Why is no real title available?)
- scientific article; zbMATH DE number 1516705 (Why is no real title available?)
- scientific article; zbMATH DE number 801745 (Why is no real title available?)
- A survey on tree edit distance and related problems
- Algorithms and Computation
- Alignment of trees -- an alternative to tree edit
- An optimal decomposition algorithm for tree edit distance
- Approximate string-matching with \(q\)-grams and maximal matches
- Comparing similar ordered trees in linear-time
- Computing similarity between RNA structures
- Constrained tree inclusion
- New algorithm for ordered tree-to-tree correction problem
- Ordered and Unordered Tree Inclusion
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- Simple and efficient string matching with k mismatches
- The Tree-to-Tree Correction Problem
- Theoretical Computer Science
Cited in
(5)
This page was built for publication: Algorithms for finding a most similar subforest
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q538470)