Tree template matching in unranked ordered trees
From MaRDI portal
Publication:396647
DOI10.1016/J.JDA.2013.02.001zbMATH Open1334.68315OpenAlexW2084831204MaRDI QIDQ396647FDOQ396647
Authors: Tomáš Flouri, Costas S. Iliopoulos, Jan Janoušek, Bořivoj Melichar, Michalis Christou, Solon P. Pissis, Jan Žďárek
Publication date: 13 August 2014
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2013.02.001
Recommendations
Cites Work
- On regular tree languages and deterministic pushdown automata
- Pattern Matching in Trees
- A new algorithm for linear regular tree pattern matching
- Algorithms for pattern matching and discovery in RNA secondary structure
- Tree template matching in ranked ordered trees by pushdown automata
- Tree template matching in ranked ordered trees by pushdown automata
Cited In (5)
- SOFSEM 2004: Theory and Practice of Computer Science
- Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
- Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
- Tree template matching in ranked ordered trees by pushdown automata
- Tree template matching in ranked ordered trees by pushdown automata
This page was built for publication: Tree template matching in unranked ordered trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396647)