On finding common subtrees

DOI10.1016/0304-3975(93)90198-3zbMath0777.68046MaRDI QIDQ1208722

Roberto Grossi

Publication date: 16 May 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(93)90198-3

zbMATH Keywords

pattern matching; ordered trees; suffix tree

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C05: Trees

68R10: Graph theory (including graph drawing) in computer science

68P05: Data structures

Related Items

Increasing the efficiency of automated theorem proving, FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES, Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species, An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation, Encoding trees by linear recurrence sequences, Computing all subtree repeats in ordered trees, Enumeration of BC-subtrees of trees, Approximating tree edit distance through string edit distance

Cites Work

• On the subtree isomorphism problem for ordered trees
• Variations on the Common Subexpression Problem
• Pattern Matching in Trees
• Efficient string matching
• A Space-Economical Suffix Tree Construction Algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item