On finding common subtrees
From MaRDI portal
Publication:1208722
DOI10.1016/0304-3975(93)90198-3zbMath0777.68046OpenAlexW1984570480MaRDI QIDQ1208722
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
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)
Related Items
Approximating tree edit distance through string edit distance ⋮ Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species ⋮ Increasing the efficiency of automated theorem proving ⋮ Computing all subtree repeats in ordered trees ⋮ Encoding trees by linear recurrence sequences ⋮ An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation ⋮ FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES ⋮ Enumeration of BC-subtrees of trees
Cites Work
This page was built for publication: On finding common subtrees