Tree inclusions in windows and slices

DOI10.1007/S10958-009-9401-7MaRDI QIDQ843598zbMATH OpenOpenAlexFDO

Authors Irène Guessarian, Patrick Cégielski

Publication date 15 January 2010

Published in Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10958-009-9401-7

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Nonnumerical algorithms (68W05)

Recommendations

• Tree inclusion problems
• On the tree inclusion problem
• scientific article; zbMATH DE number 1638647
• Constrained tree inclusion
• Constrained tree inclusion
• Ordered and Unordered Tree Inclusion
• scientific article; zbMATH DE number 4214064
• A new tree inclusion algorithm
• scientific article; zbMATH DE number 5999306
• Approximation and Online Algorithms

Cites work

• A survey on tree edit distance and related problems
• First-order queries on structures of bounded degree are computable with constant delay
• Frequent subtree mining -- an overview
• Ordered and Unordered Tree Inclusion
• Pattern Matching in Trees
• Tree inclusion problems
• Window Subsequence Problems for Compressed Texts
• Window-accumulated subsequence matching problem is linear

Cited in

(1)

• Tree inclusion problems

This page was built for publication: Tree inclusions in windows and slices

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