On the subtree isomorphism problem for ordered trees
From MaRDI portal
(Redirected from Publication:1124598)
Recommendations
Cites work
Cited in
(14)- An efficient algorithm for some tree matching problems
- An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation
- TOWARDS PARALLEL PROGRAMMING BY TRANSFORMATION: THE FAN SKELETON FRAMEWORK*
- Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species
- On finding common subtrees
- Learning grammars for architecture-specific facade parsing
- Strings, trees, and patterns
- scientific article; zbMATH DE number 3912404 (Why is no real title available?)
- Linear matching-time algorithm for the directed graph isomorphism problem
- Some comments on the subtree isomorphism problem for ordered trees
- A note on the subtree isomorphism for ordered trees and related problems
- Further comments on the subtree isomorphism for ordered trees
- scientific article; zbMATH DE number 1335884 (Why is no real title available?)
- Constrained tree inclusion
This page was built for publication: On the subtree isomorphism problem for ordered trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124598)