Detection of common subtrees with identical label distribution

DOI10.1016/J.TCS.2023.114366MaRDI QIDQ6150674zbMATH OpenOpenAlexFDO

Authors Romain Azaïs, Florian Ingels

Publication date 9 February 2024

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

Full work available at URL https://arxiv.org/abs/2307.13068

zbMATH Keywords

DAG compressionfrequent pattern miningmarked tree isomorphismunordered trees

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Frequent subtree mining -- an overview
• Mining condensed frequent subtree base
• Mining rooted ordered trees under subtree homeomorphism
• Constraint-Based Mining and Inductive Databases
• TreeMiner: An efficient algorithm for mining embedded ordered frequent trees

Cites work

• Enumeration of irredundant forests
• Graph isomorphism is in the low hierarchy
• scientific article; zbMATH DE number 2084288 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 2176112 (Why is no real title available?)
• Isomorphic unordered labeled trees up to substitution ciphering
• On the number of leaves in a random recursive tree
• Practical graph isomorphism. II.
• Reverse search for enumeration

This page was built for publication: Detection of common subtrees with identical label distribution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6150674)