On an algorithm of Zemlyachenko for subtree isomorphism

DOI10.1016/S0020-0190(99)00054-XzbMath1339.05383OpenAlexW2040344654MaRDI QIDQ294684

Michael Rodeh, Yefim Dinitz, Alon Itai

Publication date: 16 June 2016

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

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S002001909900054X?np=y

zbMATH Keywords

treeisomorphismlinear timesubtreetrie

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (10)

Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species ⋮ Exact algorithms for computing the tree edit distance between unordered trees ⋮ A bisection algorithm for grammar-based compression of ordered trees ⋮ Cleaning interval graphs ⋮ Encoding trees by linear recurrence sequences ⋮ Inferring a graph from path frequency ⋮ The saga of minimum spanning trees ⋮ Efficient enumeration of stereoisomers of tree structured molecules using dynamic programming ⋮ An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation ⋮ FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES

This page was built for publication: On an algorithm of Zemlyachenko for subtree isomorphism