On modification of Boyer-Moore-Horspool's algorithm for tree pattern matching in linearised trees

DOI10.1016/j.tcs.2020.04.027zbMath1443.68044OpenAlexW3021688769MaRDI QIDQ2182712

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

Publication date: 26 May 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2020.04.027

zbMATH Keywords

tree pattern matchingbackward pattern matchingtree linearisationtree processing

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Data structures (68P05)

Related Items (1)

A set automaton to locate all pattern matches in a term

Uses Software

• Forest FIRE

Cites Work

• A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms
• Average running time of the Boyer-Moore-Horspool algorithm
• Backward Linearised Tree Pattern Matching
• The exact online string matching problem
• Pattern Matching in Trees
• Jewels of Stringology
• Tree Template Matching in Ranked Ordered Trees by Pushdown Automata
• A Full and Linear Index of a Tree for Tree Patterns
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On modification of Boyer-Moore-Horspool's algorithm for tree pattern matching in linearised trees