Backward linearised tree pattern matching

DOI10.1007/978-3-319-15579-1_47MaRDI QIDQ2799210zbMATH OpenOpenAlexFDO

Authors Jan Trávníček, Jan Janoušek, Loek Cleophas, Bořivoj Melichar

Publication date 8 April 2016

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-15579-1_47

zbMATH Keywords

backward pattern matchingtree linearisationtree pattern matchingtree processing

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• On modification of Boyer-Moore-Horspool's algorithm for tree pattern matching in linearised trees
• scientific article; zbMATH DE number 4053042
• Patterns and pattern-matching in trees: An analysis
• Tree template matching in unranked ordered trees
• An efficient algorithm for some tree matching problems

Cited in

(5)

• On modification of Boyer-Moore-Horspool's algorithm for tree pattern matching in linearised trees
• Fast algorithms for single and multiple pattern Cartesian tree matching
• Tree pattern matching from regular tree expressions.
• A full and linear index of a tree for tree patterns
• Forward linearised tree pattern matching using tree pattern border array

This page was built for publication: Backward linearised tree pattern matching

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