On the subtree isomorphism problem for ordered trees

DOI10.1016/0020-0190(89)90056-2zbMath0679.05024OpenAlexW1978139332MaRDI QIDQ1124598

Erkki Maekinen

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90056-2

zbMATH Keywords

isomorphism problemordered tree

Mathematics Subject Classification ID

Trees (05C05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Algorithms in computer science (68W99)

Related Items

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 algorithm for some tree matching problems, A note on the subtree isomorphism for ordered trees and related problems, Further comments on the subtree isomorphism for ordered trees, Strings, trees, and patterns, TOWARDS PARALLEL PROGRAMMING BY TRANSFORMATION: THE FAN SKELETON FRAMEWORK*, On finding common subtrees, An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation, Learning grammars for architecture-specific facade parsing, Constrained tree inclusion

Cites Work

• A new algorithm for solving the tree isomorphism problem
• Lexicographic generation of ordered trees
• Pattern Matching in Trees
• An Analysis of a Good Algorithm for the Subtree Problem
• Fast Pattern Matching in Strings