The tree inclusion problem

DOI10.1145/1978782.1978793MaRDI QIDQ3189022zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Philip Bille, Inge Li Gørtz

Publication date 9 September 2014

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1978782.1978793

zbMATH Keywords

pattern matchingtree inclusion

Mathematics Subject Classification ID

Trees (05C05) Data structures (68P05) Database theory (68P15) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Automata, Languages and Programming
• On the tree inclusion problem
• scientific article; zbMATH DE number 1638647
• Linear-time algorithms for tree root problems
• Linear-Time Algorithms for Tree Root Problems
• A new tree inclusion algorithm
• On Chen and Chen's new tree inclusion algorithm
• scientific article; zbMATH DE number 1670677
• Better approximations for tree sparsity in nearly-linear time
• scientific article; zbMATH DE number 7561381

Cited in

(11)

• Mining rooted ordered trees under subtree homeomorphism
• New and improved algorithms for unordered tree inclusion
• String indexing for top-\(k\) close consecutive occurrences
• Gapped indexing for consecutive occurrences
• Longest common extensions in trees
• More Efficient Algorithm for Ordered Tree Inclusion
• Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
• A top down algorithm for constrained tree inclusion
• scientific article; zbMATH DE number 7561381 (Why is no real title available?)
• Automata, Languages and Programming
• String indexing for top-\(k\) close consecutive occurrences

This page was built for publication: The tree inclusion problem

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