On an algorithm of Zemlyachenko for subtree isomorphism
From MaRDI portal
Recommendations
Cited in
(13)- Further comments on the subtree isomorphism for ordered trees
- Encoding trees by linear recurrence sequences
- Cleaning interval graphs
- A bisection algorithm for grammar-based compression of ordered trees
- Inferring a graph from path frequency
- The saga of minimum spanning trees
- Efficient enumeration of stereoisomers of tree structured molecules using dynamic programming
- FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES
- Exact algorithms for computing the tree edit distance between unordered trees
- A linear time and space algorithm for finding isomorphic subtrees of a binary tree
- Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species
- Some comments on the subtree isomorphism problem for ordered trees
- An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation
This page was built for publication: On an algorithm of Zemlyachenko for subtree isomorphism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294684)