Tree inclusions in windows and slices
From MaRDI portal
Publication:843598
DOI10.1007/S10958-009-9401-7zbMATH Open1178.68175OpenAlexW1966409909MaRDI QIDQ843598FDOQ843598
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
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
Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Nonnumerical algorithms (68W05)
Cites Work
- A survey on tree edit distance and related problems
- First-order queries on structures of bounded degree are computable with constant delay
- Pattern Matching in Trees
- Ordered and Unordered Tree Inclusion
- Frequent subtree mining -- an overview
- Window Subsequence Problems for Compressed Texts
- Window-accumulated subsequence matching problem is linear
- Tree inclusion problems
Cited In (1)
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)
