Forward linearised tree pattern matching using tree pattern border array

DOI10.1016/J.DAM.2024.03.014MaRDI QIDQ6497942zbMATH OpenFDO

Authors Jan Trávníček, Tomáš Pecka, Robin Obůrka, Jan Janoušek

Publication date 6 May 2024

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2024.03.014

zbMATH Keywords

tree pattern matchingborder arraytree linearisationtree processingMorris-Pratt algorithm

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Theory of data (68Pxx)

Recommendations

• Backward linearised tree pattern matching
• On modification of Boyer-Moore-Horspool's algorithm for tree pattern matching in linearised trees
• scientific article; zbMATH DE number 4053042
• A full and linear index of a tree for tree patterns
• An efficient algorithm for some tree matching problems

Cites work

• A full and linear index of a tree for tree patterns
• A survey on tree matching and XML retrieval
• Arbology: trees and pushdown automata
• Border Array for Structural Strings
• Efficient string matching
• Fast Pattern Matching in Strings
• On modification of Boyer-Moore-Horspool's algorithm for tree pattern matching in linearised trees
• Pattern Matching in Trees
• Tree template matching in ranked ordered trees by pushdown automata

This page was built for publication: Forward linearised tree pattern matching using tree pattern border array

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